Theorem nfsum 11158

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.

Step	Hyp	Ref	Expression
1		df-sumdc 11155	. 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 2282	. . . . 5 |- F/_ x ZZ
3		nfsum.1	. . . . . . 7 |- F/_ x A
4		nfcv 2282	. . . . . . 7 |- F/_ x ( ZZ>= ` m )
5	3, 4	nfss 3095	. . . . . 6 |- F/ x A C_ ( ZZ>= ` m )
6	3	nfcri 2276	. . . . . . . 8 |- F/ x j e. A
7	6	nfdc 1638	. . . . . . 7 |- F/ xDECID j e. A
8	4, 7	nfralxy 2474	. . . . . 6 |- F/ x A. j e. ( ZZ>= ` m )DECID j e. A
9		nfcv 2282	. . . . . . . 8 |- F/_ x m
10		nfcv 2282	. . . . . . . 8 |- F/_ x +
11	3	nfcri 2276	. . . . . . . . . 10 |- F/ x n e. A
12		nfcv 2282	. . . . . . . . . . 11 |- F/_ x n
13		nfsum.2	. . . . . . . . . . 11 |- F/_ x B
14	12, 13	nfcsb 3042	. . . . . . . . . 10 |- F/_ x [_ n / k ]_ B
15		nfcv 2282	. . . . . . . . . 10 |- F/_ x 0
16	11, 14, 15	nfif 3505	. . . . . . . . 9 |- F/_ x if ( n e. A , [_ n / k ]_ B , 0 )
17	2, 16	nfmpt 4028	. . . . . . . 8 |- F/_ x ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ B , 0 ) )
18	9, 10, 17	nfseq 10259	. . . . . . 7 |- F/_ x seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ B , 0 ) ) )
19		nfcv 2282	. . . . . . 7 |- F/_ x ~~>
20		nfcv 2282	. . . . . . 7 |- F/_ x z
21	18, 19, 20	nfbr 3982	. . . . . 6 |- F/ x seq m ( + , ( n e. ZZ |-> if ( n e. A , [_ n / k ]_ B , 0 ) ) ) ~~> z
22	5, 8, 21	nf3an 1546	. . . . 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 )
23	2, 22	nfrexxy 2475	. . . 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 2282	. . . . 5 |- F/_ x NN
25		nfcv 2282	. . . . . . . 8 |- F/_ x f
26		nfcv 2282	. . . . . . . 8 |- F/_ x ( 1 ... m )
27	25, 26, 3	nff1o 5373	. . . . . . 7 |- F/ x f : ( 1 ... m ) -1-1-onto-> A
28		nfcv 2282	. . . . . . . . . 10 |- F/_ x 1
29		nfv 1509	. . . . . . . . . . . 12 |- F/ x n <_ m
30		nfcv 2282	. . . . . . . . . . . . 13 |- F/_ x ( f ` n )
31	30, 13	nfcsb 3042	. . . . . . . . . . . 12 |- F/_ x [_ ( f ` n ) / k ]_ B
32	29, 31, 15	nfif 3505	. . . . . . . . . . 11 |- F/_ x if ( n <_ m , [_ ( f ` n ) / k ]_ B , 0 )
33	24, 32	nfmpt 4028	. . . . . . . . . 10 |- F/_ x ( n e. NN |-> if ( n <_ m , [_ ( f ` n ) / k ]_ B , 0 ) )
34	28, 10, 33	nfseq 10259	. . . . . . . . 9 |- F/_ x seq 1 ( + , ( n e. NN |-> if ( n <_ m , [_ ( f ` n ) / k ]_ B , 0 ) ) )
35	34, 9	nffv 5439	. . . . . . . 8 |- F/_ x ( seq 1 ( + , ( n e. NN |-> if ( n <_ m , [_ ( f ` n ) / k ]_ B , 0 ) ) ) ` m )
36	35	nfeq2 2294	. . . . . . 7 |- F/ x z = ( seq 1 ( + , ( n e. NN |-> if ( n <_ m , [_ ( f ` n ) / k ]_ B , 0 ) ) ) ` m )
37	27, 36	nfan 1545	. . . . . 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 ) )
38	37	nfex 1617	. . . . 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 ) )
39	24, 38	nfrexxy 2475	. . . 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 ) )
40	23, 39	nfor 1554	. . 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 ) ) )
41	40	nfiotaw 5100	. 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 ) ) ) )
42	1, 41	nfcxfr 2279	1 |- F/_ x sum_ k e. A B

Syntax hints:   /\ wa 103   \/ wo 698  DECID wdc 820   /\ w3a 963   = wceq 1332   E.wex 1469   e. wcel 1481   F/_wnfc 2269   A.wral 2417   E.wrex 2418   [_csb 3007   C_ wss 3076   ifcif 3479   class class class wbr 3937   |-> cmpt 3997   iotacio 5094   -1-1-onto->wf1o 5130   ` cfv 5131  (class class class)co 5782   0cc0 7644   1c1 7645   + caddc 7647   <_ cle 7825   NNcn 8744   ZZcz 9078   ZZ>=cuz 9350   ...cfz 9821   seqcseq 10249   ~~> cli 11079   sum_csu 11154

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-if 3480  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-recs 6210  df-frec 6296  df-seqfrec 10250  df-sumdc 11155

This theorem is referenced by:  fsum2dlemstep  11235  fisumcom2  11239  fsumiun  11278  fsumcncntop  12764