(12steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: nat not finite 1 1 1 1 1 2

1. n : 
2. f : n
3. g : n
4. x:g(f(x)) = x
5. y:nf(g(y)) = y
6. (x.if x=0 n else f(x-1) fi)  (n+1)
7. (y.if y=n 0 else g(y)+1 fi)  (n+1)
8. y : (n+1)
9. y = n
10. g(y)+1 = 0
  f(g(y)+1-1) = y  (n+1)


By: Inst: y:nf(g(y)) = y  n Using:[y]


Generated subgoals:

None

About:
ifthenelseintnatural_numberaddsubtract
lambdaapplyfunctionequalmember
all
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(12steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc