Nuprl - Proof: exist intseg vs iter or 1 2 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 2 1

1. a :

2.

b:

, P:({a..b

}

Prop). b

a

((

i:{a..b

}. P(i))

(Or i:{a..b

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

4. b-a = 0
5. P : {a..b

}

Prop

(

i:{a..b

}. P(i))

(Or i:{a..b

}. P(i))

By:	Guarding (<prop> <prop>) BackThru: Hyp:2

Generated subgoals:

None

About:

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

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