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

1. a :

2. b :

3. P : {a..b

}

Prop
4. b

a

(

i:{a..b

}. P(i))

(Or i:{a..b

}. P(i))

By:	Rewrite by Thm* f:(AAA), u:A, a,b:, e:({a..b}A). Thm* ba (Iter(f;u) i:{a..b}. e(i)) = u

Generated subgoal:

1 5. i:{a..b}. P(i)
False
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