(14steps 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 prod 1 2 2 1

1. A : Type
2. x : A
3. f : AA
4. i : 
5. j : 
6. j1:j1<j  (k:k = ij1  f{i}{j1}(x) = f{k}(x))
7. k : 
8. k = ij
9. j = 0
10. i = 0
11. i1ij
  f{i}{j}(x) = f{k}(x)


By: Rewrite by Thm*  f:(AA), i:x:Af{i}(x) = f(f{i-1}(x)) ...w
Using:[f:= f{i} | i:= j] ...


Generated subgoal:

1   f{i}(f{i}{j-1}(x)) = f{k}(x)
4 steps

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

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