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

(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 2

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
15. i<k-1
16. k-1

j

R(f(i);y)

By:	BackThru: Trans x,y:A. R(x;y) Using:[f(k-2)] ; Decide: i = k-2

Generated subgoals:

1 17. i = k-2
R(f(i);y)
1 step

2 17. i = k-2
R(f(i);y)
2 steps

About:

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

(14steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc