Nuprl - Proof: all intseg vs iter and 1 2 2 1

(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 2 2 1

1. a :

2.

b:

, P:({a..b

}

Prop). b

a

((

i:{a..b

}. P(i))

(And i:{a..b

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

4. 0<k
5.

b:

.
5. b-a = k-1
5.

5. (

P:({a..b

}

Prop). (

i:{a..b

}. P(i))

(And i:{a..b

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

7. b-a = k
8. P : {a..b

}

Prop

(

i:{a..(b-1)

}. P(i)) & P(b-1)

(And i:{a..b-1

}. P(i)) & P(b-1)

By:	Rewrite by Hyp:5

Generated subgoals:

None

About:

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

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