Nuprl - Proof: iteration terminates 1 1 1 2 1 1

(28steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iteration terminates 1 1 1 2 1 1

1. T : Type
2. f : T

T
3. m : T

4.

x:T. m(f(x))

m(x) & (m(f(x)) = m(x)

f(x) = x)
5. x : T
6. n :

7. 0<n
8. f(f^n-1(x)) = f^n-1(x)

f^n(x) = f(f^n-1(x))

By:	Inst Thm* n,m:, f:(TT). f^n+m = f^n o f^m [T;1;n-1;f]

Generated subgoal:

1 9. f^1+n-1 = f^1 o f^n-1
f^n(x) = f(f^n-1(x))
1 step

About:

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

(28steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc