(12steps 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 inverses 1 1 2

1. A : Type
2. f : AA
3. g : AA
4. InvFuns(A;A;f;g)
5. x : A
6. i : 
7. 0<i
8. g{i-1}(f{i-1}(x)) = x
  g{i}(f{i}(x)) = x


By: Rewrite by g{i}(f{i}(x)) = g{i-1}(g(f(f{i-1}(x))))  A


Generated subgoals:

1   g{i}(f{i}(x)) = g{i-1}(g(f(f{i-1}(x))))
2 steps
2   g{i-1}(g(f(f{i-1}(x)))) = x
1 step

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

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