Nuprl - Proof: compose iter prod 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

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

f{

i}{

j}(x) = f{

k}(x)

By:	Decide: j = 0 ...

Generated subgoals:

1 9. j = 0
f{i}{j}(x) = f{k}(x)
2 steps

2 9. j = 0
f{i}{j}(x) = f{k}(x)
10 steps

About:

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

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