Nuprl - Proof: iteration terminates 1 1 1 2 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. 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(f^n(x)) = f^n(x)

By:	Subst (f^n(x) = f(f^n-1(x))) 0

Generated subgoals:

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

2 f(f(f^n-1(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