Nuprl - Proof: all intseg vs iter and 1 3

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

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

1. a :

2.

b:

, P:({a..b

}

Prop). b

a

((

i:{a..b

}. P(i))

(And i:{a..b

}. P(i)))
3.

k:

, b:

.
3. b-a = k

(

P:({a..b

}

Prop). (

i:{a..b

}. P(i))

(And i:{a..b

}. P(i)))

b:

, P:({a..b

}

Prop). (

i:{a..b

}. P(i))

(And i:{a..b

}. P(i))

By:

UnivCD

Generated subgoal:

1 4. b :
5. P : {a..b}Prop
(i:{a..b}. P(i)) (And i:{a..b}. P(i))
3 steps

About:

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

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