Nuprl - Proof: compose iter surjection 1 2 1 1 1 1 1 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 surjection 1 2 1 1 1 1 1 1

1. A : Type
2. f : A

A
3. Surj(A; A; f)
4. i :

5. 0<i
6. b : A
7. a : A
8. f{

i-1}(a) = b
9. u : A
10. f(u) = a
11. f{

i-1}(f(u)) = b

f{

i}(u) = f{

i-1}(f{

1}(u))

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

Generated subgoals:

None

About:

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

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