Go backward to Decomposing the GoalGo up to TopGo forward to Typical Constant Names |

*Proposition:*
For proving with knowledge `K` the goal **forall** `x`: `G`,
it suffices to prove `G`[`x` <- `a`]
where `a` is an object constant
that does not appear in `K`
and not in `G`.

~~>

Kforallx:G(

KG[x<-a]anot inKunion {G})

"We prove (**forall** `x`: `G`). We take an arbitrary (but
fixed) constant `a` and show `G`[`x` <- `a`]."

*No knowledge is available about constant yet.*

Author: Wolfgang Schreiner

Last Modification: November 30, 1999