(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: mul via intseg split pluck


  a,c,b:e:({a..b}).
  ac
  
  c<b  ( i:{a..b}. e(i)) = ( i:{a..c}. e(i))e(c)( i:{c+1..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*  (c<b
Thm*  (
Thm*  ((Iter(f;ui:{a..b}. e(i))
Thm*  (=
Thm*  (f((Iter(f;ui:{a..c}. e(i)),f(e(c),Iter(f;ui:{c+1..b}. e(i))))
Using:[ | x,yxy | 1]
THEN
OnAllClauses Reduce


Generated subgoals:

1   is_ident(; (x,yxy); 1)
2 steps
2   is_assoc_sep(; (x,yxy))
2 steps

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

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