Nuprl - Proof: exist intseg vs iter or 1 3 1

(13steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: exist intseg vs iter or 1 3 1

1. a :

2.

b:

, P:({a..b

}

Prop). b

a

((

i:{a..b

}. P(i))

(Or i:{a..b

}. P(i)))
3.

k:

, b:

.
3. b-a = k

(

P:({a..b

}

Prop). (

i:{a..b

}. P(i))

(Or i:{a..b

}. P(i)))
4. b :

5. P : {a..b

}

Prop

(

i:{a..b

}. P(i))

(Or i:{a..b

}. P(i))

By:	Decide: ba

Generated subgoals:

1 6. ba
(i:{a..b}. P(i)) (Or i:{a..b}. P(i))
1 step

2 6. ba
(i:{a..b}. P(i)) (Or i:{a..b}. P(i))
1 step

About:

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

(13steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc