Go backward to Example
Go up to Top
Go forward to
|
Go backward to Example Go up to Top Go forward to |
|
Proposition: In order to prove F, it suffices to prove
(forall y in N: y=T => F)where y does not occur freely in T or F.
Consequence: in order to prove
forall x0, ..., xn-1: Fwe may prove
(forall x0, ..., xn-1,y in N: y=T => F)where T is a term with free variables x0, ..., xn-1.
We introduce a variable over N to proceed by induction.