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

Theorem nfsum 11908
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 11905 . 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 2372 . . . . 5  |-  F/_ x ZZ
3 nfsum.1 . . . . . . 7  |-  F/_ x A
4 nfcv 2372 . . . . . . 7  |-  F/_ x
( ZZ>= `  m )
53, 4nfss 3218 . . . . . 6  |-  F/ x  A  C_  ( ZZ>= `  m
)
63nfcri 2366 . . . . . . . 8  |-  F/ x  j  e.  A
76nfdc 1705 . . . . . . 7  |-  F/ xDECID  j  e.  A
84, 7nfralxy 2568 . . . . . 6  |-  F/ x A. j  e.  ( ZZ>=
`  m )DECID  j  e.  A
9 nfcv 2372 . . . . . . . 8  |-  F/_ x m
10 nfcv 2372 . . . . . . . 8  |-  F/_ x  +
113nfcri 2366 . . . . . . . . . 10  |-  F/ x  n  e.  A
12 nfcv 2372 . . . . . . . . . . 11  |-  F/_ x n
13 nfsum.2 . . . . . . . . . . 11  |-  F/_ x B
1412, 13nfcsb 3163 . . . . . . . . . 10  |-  F/_ x [_ n  /  k ]_ B
15 nfcv 2372 . . . . . . . . . 10  |-  F/_ x
0
1611, 14, 15nfif 3632 . . . . . . . . 9  |-  F/_ x if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 )
172, 16nfmpt 4179 . . . . . . . 8  |-  F/_ x
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) )
189, 10, 17nfseq 10709 . . . . . . 7  |-  F/_ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )
19 nfcv 2372 . . . . . . 7  |-  F/_ x  ~~>
20 nfcv 2372 . . . . . . 7  |-  F/_ x
z
2118, 19, 20nfbr 4133 . . . . . 6  |-  F/ x  seq m (  +  , 
( n  e.  ZZ  |->  if ( n  e.  A ,  [_ n  /  k ]_ B ,  0 ) ) )  ~~>  z
225, 8, 21nf3an 1612 . . . . 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 2569 . . . 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 2372 . . . . 5  |-  F/_ x NN
25 nfcv 2372 . . . . . . . 8  |-  F/_ x
f
26 nfcv 2372 . . . . . . . 8  |-  F/_ x
( 1 ... m
)
2725, 26, 3nff1o 5578 . . . . . . 7  |-  F/ x  f : ( 1 ... m ) -1-1-onto-> A
28 nfcv 2372 . . . . . . . . . 10  |-  F/_ x
1
29 nfv 1574 . . . . . . . . . . . 12  |-  F/ x  n  <_  m
30 nfcv 2372 . . . . . . . . . . . . 13  |-  F/_ x
( f `  n
)
3130, 13nfcsb 3163 . . . . . . . . . . . 12  |-  F/_ x [_ ( f `  n
)  /  k ]_ B
3229, 31, 15nfif 3632 . . . . . . . . . . 11  |-  F/_ x if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 )
3324, 32nfmpt 4179 . . . . . . . . . 10  |-  F/_ x
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) )
3428, 10, 33nfseq 10709 . . . . . . . . 9  |-  F/_ x  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) )
3534, 9nffv 5645 . . . . . . . 8  |-  F/_ x
(  seq 1 (  +  ,  ( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n
)  /  k ]_ B ,  0 ) ) ) `  m
)
3635nfeq2 2384 . . . . . . 7  |-  F/ x  z  =  (  seq 1 (  +  , 
( n  e.  NN  |->  if ( n  <_  m ,  [_ ( f `  n )  /  k ]_ B ,  0 ) ) ) `  m
)
3727, 36nfan 1611 . . . . . 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 1683 . . . . 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 2569 . . . 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 1620 . . 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 5288 . 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 2369 1  |-  F/_ x sum_ k  e.  A  B
Colors of variables: wff set class
Syntax hints:    /\ wa 104    \/ wo 713  DECID wdc 839    /\ w3a 1002    = wceq 1395   E.wex 1538    e. wcel 2200   F/_wnfc 2359   A.wral 2508   E.wrex 2509   [_csb 3125    C_ wss 3198   ifcif 3603   class class class wbr 4086    |-> cmpt 4148   iotacio 5282   -1-1-onto->wf1o 5323   ` cfv 5324  (class class class)co 6013   0cc0 8022   1c1 8023    + caddc 8025    <_ cle 8205   NNcn 9133   ZZcz 9469   ZZ>=cuz 9745   ...cfz 10233    seqcseq 10699    ~~> cli 11829   sum_csu 11904
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-recs 6466  df-frec 6552  df-seqfrec 10700  df-sumdc 11905
This theorem is referenced by:  fsum2dlemstep  11985  fisumcom2  11989  fsumiun  12028  fsumcncntop  15281  dvmptfsum  15439
  Copyright terms: Public domain W3C validator