Nuprl - Proof: decidable l exists 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: decidable l exists 1

1. A : Type
2. F : A

Prop
3. A List
4.

k:A. Dec(F(k))

Dec((

nil.F(k)))

By:	(RWO Thm* P:(TProp). (xnil.P(x)) False 0) THEN ProveDecidable

Generated subgoals:

None

About:

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