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

1. A : Type
2. a : A
3. f : AA
4. Inj(AAf)
5. (x:Af(x) = a)
6. n1 : 
7. n2 : 
8. f{n1}(a) = f{n2}(a)
9. n1<n2
  x:Af(x) = a


By: Rewrite8 by Thm*  x:Af:(AA), k:i:{0...k}. f{k}(x) = f{i}(f{k-i}(x))
Using:[x:= a | k:= n2 | i:= n1]


Generated subgoal:

1 10. f{n1}(a) = f{n1}(f{n2-n1}(a))
  x:Af(x) = a

4 steps

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

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