ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfsum Unicode version

Theorem nfsum 12148
Description: Bound-variable hypothesis builder for sum: if  x is (effectively) not free in  A and  B, it is not free in  sum_ k  e.  A B. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)
Hypotheses
Ref Expression
nfsum.1  |-  F/_ x A
nfsum.2  |-  F/_ x B
Assertion
Ref Expression
nfsum  |-  F/_ x sum_ k  e.  A  B

Proof of Theorem nfsum
Dummy variables  f  j  m  n  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sumdc 12145 . 2  |-  sum_ k  e.  A  B  =  ( iota z ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m
)  /\  A. j  e.  ( ZZ>= `  m )DECID  j  e.  A  /\  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z )  \/  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
) ) ) )
2 nfcv 2392 . . . . 5  |-  F/_ x ZZ
3 nfsum.1 . . . . . . 7  |-  F/_ x A
4 nfcv 2392 . . . . . . 7  |-  F/_ x
( ZZ>= `  m )
53, 4nfss 3241 . . . . . 6  |-  F/ x  A  C_  ( ZZ>= `  m
)
63nfcri 2386 . . . . . . . 8  |-  F/ x  j  e.  A
76nfdc 1711 . . . . . . 7  |-  F/ xDECID  j  e.  A
84, 7nfralxy 2588 . . . . . 6  |-  F/ x A. j  e.  ( ZZ>=
`  m )DECID  j  e.  A
9 nfcv 2392 . . . . . . . 8  |-  F/_ x m
10 nfcv 2392 . . . . . . . 8  |-  F/_ x  +
113nfcri 2386 . . . . . . . . . 10  |-  F/ x  n  e.  A
12 nfcv 2392 . . . . . . . . . . 11  |-  F/_ x n
13 nfsum.2 . . . . . . . . . . 11  |-  F/_ x B
1412, 13nfcsb 3185 . . . . . . . . . 10  |-  F/_ x [_ n  /  k ]_ B
15 nfcv 2392 . . . . . . . . . 10  |-  F/_ x
0
1611, 14, 15nfif 3669 . . . . . . . . 9  |-  F/_ x if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 )
172, 16nfmpt 4225 . . . . . . . 8  |-  F/_ x
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) )
189, 10, 17nfseq 10915 . . . . . . 7  |-  F/_ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )
19 nfcv 2392 . . . . . . 7  |-  F/_ x  ~~>
20 nfcv 2392 . . . . . . 7  |-  F/_ x
z
2118, 19, 20nfbr 4178 . . . . . 6  |-  F/ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z
225, 8, 21nf3an 1619 . . . . 5  |-  F/ x
( A  C_  ( ZZ>=
`  m )  /\  A. j  e.  ( ZZ>= `  m )DECID  j  e.  A  /\  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z )
232, 22nfrexw 2589 . . . 4  |-  F/ x E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  A. j  e.  ( ZZ>= `  m )DECID  j  e.  A  /\  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z )
24 nfcv 2392 . . . . 5  |-  F/_ x NN
25 nfcv 2392 . . . . . . . 8  |-  F/_ x
f
26 nfcv 2392 . . . . . . . 8  |-  F/_ x
( 1 ... m
)
2725, 26, 3nff1o 5640 . . . . . . 7  |-  F/ x  f : ( 1 ... m ) -1-1-onto-> A
28 nfcv 2392 . . . . . . . . . 10  |-  F/_ x
1
29 nfv 1581 . . . . . . . . . . . 12  |-  F/ x  n  <_  m
30 nfcv 2392 . . . . . . . . . . . . 13  |-  F/_ x
( f `  n
)
3130, 13nfcsb 3185 . . . . . . . . . . . 12  |-  F/_ x [_ ( f `  n
)  /  k ]_ B
3229, 31, 15nfif 3669 . . . . . . . . . . 11  |-  F/_ x if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 )
3324, 32nfmpt 4225 . . . . . . . . . 10  |-  F/_ x
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) )
3428, 10, 33nfseq 10915 . . . . . . . . 9  |-  F/_ x  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) )
3534, 9nffv 5708 . . . . . . . 8  |-  F/_ x
(  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
)
3635nfeq2 2404 . . . . . . 7  |-  F/ x  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
)
3727, 36nfan 1618 . . . . . 6  |-  F/ x
( f : ( 1 ... m ) -1-1-onto-> A  /\  z  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
) )
3837nfex 1690 . . . . 5  |-  F/ x E. f ( f : ( 1 ... m
)
-1-1-onto-> A  /\  z  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
) )
3924, 38nfrexw 2589 . . . 4  |-  F/ x E. m  e.  NN  E. f ( f : ( 1 ... m
)
-1-1-onto-> A  /\  z  =  (  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
) )
4023, 39nfor 1627 . . 3  |-  F/ x
( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m )  /\  A. j  e.  (
ZZ>= `  m )DECID  j  e.  A  /\  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z )  \/  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
) ) )
4140nfiotaw 5344 . 2  |-  F/_ x
( iota z ( E. m  e.  ZZ  ( A  C_  ( ZZ>= `  m
)  /\  A. j  e.  ( ZZ>= `  m )DECID  j  e.  A  /\  seq m
(  +  ,  ( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z )  \/  E. m  e.  NN  E. f ( f : ( 1 ... m ) -1-1-onto-> A  /\  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
) ) ) )
421, 41nfcxfr 2389 1  |-  F/_ x sum_ k  e.  A  B
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    \/ wo 720  DECID wdc 846    /\ w3a 1009    = wceq 1402   E.wex 1545    e. wcel 2209   F/_wnfc 2379   A.wral 2528   E.wrex 2529   [_csb 3147    C_ wss 3220   ifcif 3638   class class class wbr 4131    |-> cmpt 4193   iotacio 5338   -1-1-onto->wf1o 5379   ` cfv 5380  (class class class)co 6088   0cc0 8185   1c1 8186    + caddc 8188    <_ cle 8367   NNcn 9313   ZZcz 9655   ZZ>=cuz 9937   ...cfz 10428    seqcseq 10905    ~~> cli 12069   sum_csu 12144
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-recs 6580  df-frec 6666  df-seqfrec 10906  df-sumdc 12145
This theorem is used by:  fsum2dlemstep  12226  fisumcom2  12230  fsumiun  12269  fsumcncntop  15793  dvmptfsum  15951
  Copyright terms: Public domain W3C validator