Nuprl - Proof: least exists2 1 1 2

(9steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: least exists2 1 1 2

1. P :

Prop
2.

i:

. P(i) [not for witness]
3. p :

4.

i:

. p(i)

P(i)
5. (least i:

. p(i))

{i:

| p(i) & (

j:

. j<i

p(j)) }

{i:

| P(i) & (

j:

. j<i

P(j)) }

By:	Witness: least i:. p(i)

Generated subgoal:

1 2. i:. P(i)
3. p :
4. i:. p(i)  P(i)
5. (least i:. p(i))  {i:| p(i) & (j:. j<i  p(j)) }
  (least i:. p(i))  {i:| P(i) & (j:. j<i  P(j)) }
3 steps

About:

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

(9steps total) Remark PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc