Nuprl - Proof: compose iter inverses 1 1 2 1

(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

1. A : Type
2. f : A

A
3. g : A

A
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)) = g{

i-1}(g(f(f{

i-1}(x))))

By:	Thm* x:A, f:(AA), i,j,k:. k = i+j f{i}(f{j}(x)) = f{k}(x)

Generated subgoal:

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

About:

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

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