Nuprl - Proof: decidable es-locl 2

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: decidable es-locl 2

1. the_es : ES
2. WellFnd{i}(E;x,y.(x <loc y))
3. j : E
4.

k:E. (k <loc j)

(

e:E. Dec((e <loc k)))
5.

first(j)

e:E. Dec((e <loc j))

By:	Auto THEN RWO Thm* the_es:ES, e,e':E. Thm* (e <loc e') first(e') & e = pred(e') E (e <loc pred(e')) 0 THEN BackThru Thm* Dec(P) Dec(Q) Dec(P & Q) THEN Try (Complete Auto) THEN BackThru Thm* Dec(P) Dec(Q) Dec(P Q) THEN Try (Complete Auto)

Generated subgoal:

1 6. e : E
Dec((e <loc pred(j)))
2 steps

About:

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