(13steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: compose iter inj cycles 1 1 2

1. k : 
2. f : kk
3. Inj(kkf)
4. u : k
5. i,j:i<j & f{j}(u) = f{i}(u)
  i:f{i}(u) = u


By: ExistHD Hyp:-1


Generated subgoal:

1 5. i : 
6. j : 
7. i<j
8. f{j}(u) = f{i}(u)
  i:f{i}(u) = u

3 steps

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

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