Nuprl - Proof: no finite model lemma 1 2 1 1 2 1

(14steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: no finite model lemma 1 2 1 1 2 1

1. A : Type
2. R : A

A

Prop
3.

A
4. Trans x,y:A. R(x;y)
5.

x:A.

y:A. R(x;y)
6. k :

7. 1<k
8. f :

(k-1)

A
9.

i,j:

(k-1). i<j

R(f(i);f(j))
10. y : A
11. R(f(k-2);y)
12. i :

k
13. j :

k
14. i<j

R(if i<

k-1

f(i) else y fi;if j<

k-1

f(j) else y fi)

By:	2 Times SplitOnConclITE

Generated subgoals:

1 15. i<k-1
16. j<k-1
R(f(i);f(j))
1 step

2 15. i<k-1
16. k-1j
R(f(i);y)
4 steps

About:

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

(14steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc