Nuprl - Proof: sum via intseg null

PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Search Doc

IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sum via intseg null

a,b:

, e:({a..b

}

). b

a

(

i:{a..b

}. e(i)) = 0

By:	Inst: Thm* f:(AAA), u:A, a,b:, e:({a..b}A). Thm* ba (Iter(f;u) i:{a..b}. e(i)) = u Using:[A:= \| f:= x,y. x+y \| 0] THEN Reduce Hyp:-1

Generated subgoals:

None

About:

IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html

PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Search Doc