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

Theorem nfsum 12067
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 12064 . 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 2386 . . . . 5  |-  F/_ x ZZ
3 nfsum.1 . . . . . . 7  |-  F/_ x A
4 nfcv 2386 . . . . . . 7  |-  F/_ x
( ZZ>= `  m )
53, 4nfss 3235 . . . . . 6  |-  F/ x  A  C_  ( ZZ>= `  m
)
63nfcri 2380 . . . . . . . 8  |-  F/ x  j  e.  A
76nfdc 1707 . . . . . . 7  |-  F/ xDECID  j  e.  A
84, 7nfralxy 2582 . . . . . 6  |-  F/ x A. j  e.  ( ZZ>=
`  m )DECID  j  e.  A
9 nfcv 2386 . . . . . . . 8  |-  F/_ x m
10 nfcv 2386 . . . . . . . 8  |-  F/_ x  +
113nfcri 2380 . . . . . . . . . 10  |-  F/ x  n  e.  A
12 nfcv 2386 . . . . . . . . . . 11  |-  F/_ x n
13 nfsum.2 . . . . . . . . . . 11  |-  F/_ x B
1412, 13nfcsb 3179 . . . . . . . . . 10  |-  F/_ x [_ n  /  k ]_ B
15 nfcv 2386 . . . . . . . . . 10  |-  F/_ x
0
1611, 14, 15nfif 3655 . . . . . . . . 9  |-  F/_ x if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 )
172, 16nfmpt 4207 . . . . . . . 8  |-  F/_ x
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) )
189, 10, 17nfseq 10843 . . . . . . 7  |-  F/_ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )
19 nfcv 2386 . . . . . . 7  |-  F/_ x  ~~>
20 nfcv 2386 . . . . . . 7  |-  F/_ x
z
2118, 19, 20nfbr 4161 . . . . . 6  |-  F/ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z
225, 8, 21nf3an 1615 . . . . 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 2583 . . . 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 2386 . . . . 5  |-  F/_ x NN
25 nfcv 2386 . . . . . . . 8  |-  F/_ x
f
26 nfcv 2386 . . . . . . . 8  |-  F/_ x
( 1 ... m
)
2725, 26, 3nff1o 5617 . . . . . . 7  |-  F/ x  f : ( 1 ... m ) -1-1-onto-> A
28 nfcv 2386 . . . . . . . . . 10  |-  F/_ x
1
29 nfv 1577 . . . . . . . . . . . 12  |-  F/ x  n  <_  m
30 nfcv 2386 . . . . . . . . . . . . 13  |-  F/_ x
( f `  n
)
3130, 13nfcsb 3179 . . . . . . . . . . . 12  |-  F/_ x [_ ( f `  n
)  /  k ]_ B
3229, 31, 15nfif 3655 . . . . . . . . . . 11  |-  F/_ x if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 )
3324, 32nfmpt 4207 . . . . . . . . . 10  |-  F/_ x
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) )
3428, 10, 33nfseq 10843 . . . . . . . . 9  |-  F/_ x  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) )
3534, 9nffv 5685 . . . . . . . 8  |-  F/_ x
(  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
)
3635nfeq2 2398 . . . . . . 7  |-  F/ x  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
)
3727, 36nfan 1614 . . . . . 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 1686 . . . . 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 2583 . . . 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 1623 . . 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 5321 . 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 2383 1  |-  F/_ x sum_ k  e.  A  B
Colors of variables: wff set class
Syntax hints:    /\ wa 104    \/ wo 716  DECID wdc 842    /\ w3a 1005    = wceq 1398   E.wex 1541    e. wcel 2205   F/_wnfc 2373   A.wral 2522   E.wrex 2523   [_csb 3141    C_ wss 3214   ifcif 3624   class class class wbr 4114    |-> cmpt 4176   iotacio 5315   -1-1-onto->wf1o 5356   ` cfv 5357  (class class class)co 6058   0cc0 8143   1c1 8144    + caddc 8146    <_ cle 8325   NNcn 9254   ZZcz 9594   ZZ>=cuz 9871   ...cfz 10361    seqcseq 10833    ~~> cli 11988   sum_csu 12063
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-if 3625  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-recs 6549  df-frec 6635  df-seqfrec 10834  df-sumdc 12064
This theorem is referenced by:  fsum2dlemstep  12145  fisumcom2  12149  fsumiun  12188  fsumcncntop  15558  dvmptfsum  15716
  Copyright terms: Public domain W3C validator