Theorem nfsum1 11319

Description: Bound-variable hypothesis builder for sum. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.)

Hypothesis

Ref	Expression
nfsum1.1	⊢ Ⅎ𝑘𝐴

Assertion

Ref	Expression
nfsum1	⊢ Ⅎ𝑘Σ𝑘 ∈ 𝐴 𝐵

Proof of Theorem nfsum1

Dummy variables 𝑓 𝑗 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sumdc 11317	. 2 ⊢ Σ𝑘 ∈ 𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))))
2		nfcv 2312	. . . . 5 ⊢ Ⅎ𝑘ℤ
3		nfsum1.1	. . . . . . 7 ⊢ Ⅎ𝑘𝐴
4		nfcv 2312	. . . . . . 7 ⊢ Ⅎ𝑘(ℤ≥‘𝑚)
5	3, 4	nfss 3140	. . . . . 6 ⊢ Ⅎ𝑘 𝐴 ⊆ (ℤ≥‘𝑚)
6	3	nfcri 2306	. . . . . . . 8 ⊢ Ⅎ𝑘 𝑗 ∈ 𝐴
7	6	nfdc 1652	. . . . . . 7 ⊢ Ⅎ𝑘DECID 𝑗 ∈ 𝐴
8	4, 7	nfralxy 2508	. . . . . 6 ⊢ Ⅎ𝑘∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴
9		nfcv 2312	. . . . . . . 8 ⊢ Ⅎ𝑘𝑚
10		nfcv 2312	. . . . . . . 8 ⊢ Ⅎ𝑘 +
11	3	nfcri 2306	. . . . . . . . . 10 ⊢ Ⅎ𝑘 𝑛 ∈ 𝐴
12		nfcsb1v 3082	. . . . . . . . . 10 ⊢ Ⅎ𝑘⦋𝑛 / 𝑘⦌𝐵
13		nfcv 2312	. . . . . . . . . 10 ⊢ Ⅎ𝑘0
14	11, 12, 13	nfif 3554	. . . . . . . . 9 ⊢ Ⅎ𝑘if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0)
15	2, 14	nfmpt 4081	. . . . . . . 8 ⊢ Ⅎ𝑘(𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))
16	9, 10, 15	nfseq 10411	. . . . . . 7 ⊢ Ⅎ𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0)))
17		nfcv 2312	. . . . . . 7 ⊢ Ⅎ𝑘 ⇝
18		nfcv 2312	. . . . . . 7 ⊢ Ⅎ𝑘𝑥
19	16, 17, 18	nfbr 4035	. . . . . 6 ⊢ Ⅎ𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥
20	5, 8, 19	nf3an 1559	. . . . 5 ⊢ Ⅎ𝑘(𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥)
21	2, 20	nfrexya 2511	. . . 4 ⊢ Ⅎ𝑘∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥)
22		nfcv 2312	. . . . 5 ⊢ Ⅎ𝑘ℕ
23		nfcv 2312	. . . . . . . 8 ⊢ Ⅎ𝑘𝑓
24		nfcv 2312	. . . . . . . 8 ⊢ Ⅎ𝑘(1...𝑚)
25	23, 24, 3	nff1o 5440	. . . . . . 7 ⊢ Ⅎ𝑘 𝑓:(1...𝑚)–1-1-onto→𝐴
26		nfcv 2312	. . . . . . . . . 10 ⊢ Ⅎ𝑘1
27		nfv 1521	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘 𝑛 ≤ 𝑚
28		nfcsb1v 3082	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘⦋(𝑓‘𝑛) / 𝑘⦌𝐵
29	27, 28, 13	nfif 3554	. . . . . . . . . . 11 ⊢ Ⅎ𝑘if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)
30	22, 29	nfmpt 4081	. . . . . . . . . 10 ⊢ Ⅎ𝑘(𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0))
31	26, 10, 30	nfseq 10411	. . . . . . . . 9 ⊢ Ⅎ𝑘seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))
32	31, 9	nffv 5506	. . . . . . . 8 ⊢ Ⅎ𝑘(seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)
33	32	nfeq2 2324	. . . . . . 7 ⊢ Ⅎ𝑘 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)
34	25, 33	nfan 1558	. . . . . 6 ⊢ Ⅎ𝑘(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))
35	34	nfex 1630	. . . . 5 ⊢ Ⅎ𝑘∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))
36	22, 35	nfrexya 2511	. . . 4 ⊢ Ⅎ𝑘∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))
37	21, 36	nfor 1567	. . 3 ⊢ Ⅎ𝑘(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚)))
38	37	nfiotaw 5164	. 2 ⊢ Ⅎ𝑘(℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ≥‘𝑚) ∧ ∀𝑗 ∈ (ℤ≥‘𝑚)DECID 𝑗 ∈ 𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛 ∈ 𝐴, ⦋𝑛 / 𝑘⦌𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto→𝐴 ∧ 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ≤ 𝑚, ⦋(𝑓‘𝑛) / 𝑘⦌𝐵, 0)))‘𝑚))))
39	1, 38	nfcxfr 2309	1 ⊢ Ⅎ𝑘Σ𝑘 ∈ 𝐴 𝐵

Syntax hints:   ∧ wa 103   ∨ wo 703  DECID wdc 829   ∧ w3a 973   = wceq 1348  ∃wex 1485   ∈ wcel 2141  Ⅎwnfc 2299  ∀wral 2448  ∃wrex 2449  ⦋csb 3049   ⊆ wss 3121  ifcif 3526   class class class wbr 3989   ↦ cmpt 4050  ℩cio 5158  –1-1-onto→wf1o 5197  ‘cfv 5198  (class class class)co 5853  0cc0 7774  1c1 7775   + caddc 7777   ≤ cle 7955  ℕcn 8878  ℤcz 9212  ℤ_≥cuz 9487  ...cfz 9965  seqcseq 10401   ⇝ cli 11241  Σcsu 11316

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-if 3527  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-recs 6284  df-frec 6370  df-seqfrec 10402  df-sumdc 11317

This theorem is referenced by:  mertenslem2  11499