(5steps total) PrintForm Definitions Lemmas IteratedBinops Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Splitting the range of iteration.

At: sum via intseg split mid


  a,c,b:e:({a..b}).
  ac  cb  ( i:{a..b}. e(i)) = ( i:{a..c}. e(i))+( i:{c..b}. e(i))


By: Inst: 
Thm*  f:(AAA), u:A.
Thm*  is_ident(Afu)
Thm*  
Thm*  is_assoc_sep(Af)
Thm*  
Thm*  (a,c,b:e:({a..b}A).
Thm*  (ac
Thm*  (
Thm*  (cb
Thm*  (
Thm*  ((Iter(f;ui:{a..b}. e(i))
Thm*  (=
Thm*  (f((Iter(f;ui:{a..c}. e(i)),Iter(f;ui:{c..b}. e(i)))
Using:[ | x,yx+y | 0]
THEN
OnAllClauses Reduce


Generated subgoals:

1   is_ident(; (x,yx+y); 0)
2 steps
2   is_assoc_sep(; (x,yx+y))
2 steps

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

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