Nuprl - Proof: compose iter prod 1 2 1 1 1

(14steps 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 prod 1 2 1 1 1

1. A : Type
2. x : A
3. f : A

A
4. i :

5. j :

6.

j1:

. j1<j

(

k:

. k = i

j1

f{

i}{

j1}(x) = f{

k}(x))
7. k :

8. k = i

j
9.

j = 0
10. i = 0

Id{

j}(x) = Id(x)

A

By:	Inst: Thm* i:. Id{i} = Id AA Using:[A:= A \| i:= j] ... THEN ApFun: Hyp:-1 to: x ...

Generated subgoals:

None

About:

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

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