MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfsumOLD Structured version   Visualization version   GIF version

Theorem nfsumOLD 15413
Description: Obsolete version of nfsum 15412 as of 24-Feb-2024. Bound-variable hypothesis builder for sum: if 𝑥 is (effectively) not free in 𝐴 and 𝐵, it is not free in Σ𝑘𝐴𝐵. (Contributed by NM, 11-Dec-2005.) (Revised by Mario Carneiro, 13-Jun-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
nfsumOLD.1 𝑥𝐴
nfsumOLD.2 𝑥𝐵
Assertion
Ref Expression
nfsumOLD 𝑥Σ𝑘𝐴 𝐵

Proof of Theorem nfsumOLD
Dummy variables 𝑓 𝑚 𝑛 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sum 15408 . 2 Σ𝑘𝐴 𝐵 = (℩𝑧(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
2 nfcv 2907 . . . . 5 𝑥
3 nfsumOLD.1 . . . . . . 7 𝑥𝐴
4 nfcv 2907 . . . . . . 7 𝑥(ℤ𝑚)
53, 4nfss 3912 . . . . . 6 𝑥 𝐴 ⊆ (ℤ𝑚)
6 nfcv 2907 . . . . . . . 8 𝑥𝑚
7 nfcv 2907 . . . . . . . 8 𝑥 +
83nfcri 2894 . . . . . . . . . 10 𝑥 𝑛𝐴
9 nfcv 2907 . . . . . . . . . . 11 𝑥𝑛
10 nfsumOLD.2 . . . . . . . . . . 11 𝑥𝐵
119, 10nfcsb 3859 . . . . . . . . . 10 𝑥𝑛 / 𝑘𝐵
12 nfcv 2907 . . . . . . . . . 10 𝑥0
138, 11, 12nfif 4489 . . . . . . . . 9 𝑥if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)
142, 13nfmpt 5180 . . . . . . . 8 𝑥(𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))
156, 7, 14nfseq 13741 . . . . . . 7 𝑥seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)))
16 nfcv 2907 . . . . . . 7 𝑥
17 nfcv 2907 . . . . . . 7 𝑥𝑧
1815, 16, 17nfbr 5120 . . . . . 6 𝑥seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧
195, 18nfan 1902 . . . . 5 𝑥(𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧)
202, 19nfrex 3240 . . . 4 𝑥𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧)
21 nfcv 2907 . . . . 5 𝑥
22 nfcv 2907 . . . . . . . 8 𝑥𝑓
23 nfcv 2907 . . . . . . . 8 𝑥(1...𝑚)
2422, 23, 3nff1o 6706 . . . . . . 7 𝑥 𝑓:(1...𝑚)–1-1-onto𝐴
25 nfcv 2907 . . . . . . . . . 10 𝑥1
26 nfcv 2907 . . . . . . . . . . . 12 𝑥(𝑓𝑛)
2726, 10nfcsb 3859 . . . . . . . . . . 11 𝑥(𝑓𝑛) / 𝑘𝐵
2821, 27nfmpt 5180 . . . . . . . . . 10 𝑥(𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
2925, 7, 28nfseq 13741 . . . . . . . . 9 𝑥seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))
3029, 6nffv 6776 . . . . . . . 8 𝑥(seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3130nfeq2 2924 . . . . . . 7 𝑥 𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3224, 31nfan 1902 . . . . . 6 𝑥(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3332nfex 2318 . . . . 5 𝑥𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3421, 33nfrex 3240 . . . 4 𝑥𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3520, 34nfor 1907 . . 3 𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
3635nfiota 6390 . 2 𝑥(℩𝑧(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
371, 36nfcxfr 2905 1 𝑥Σ𝑘𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wa 396  wo 844   = wceq 1539  wex 1782  wcel 2106  wnfc 2887  wrex 3065  csb 3831  wss 3886  ifcif 4459   class class class wbr 5073  cmpt 5156  cio 6382  1-1-ontowf1o 6425  cfv 6426  (class class class)co 7267  0cc0 10881  1c1 10882   + caddc 10884  cn 11983  cz 12329  cuz 12592  ...cfz 13249  seqcseq 13731  cli 15203  Σcsu 15407
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3431  df-sbc 3716  df-csb 3832  df-dif 3889  df-un 3891  df-in 3893  df-ss 3903  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5074  df-opab 5136  df-mpt 5157  df-xp 5590  df-rel 5591  df-cnv 5592  df-co 5593  df-dm 5594  df-rn 5595  df-res 5596  df-ima 5597  df-pred 6195  df-iota 6384  df-fun 6428  df-fn 6429  df-f 6430  df-f1 6431  df-fo 6432  df-f1o 6433  df-fv 6434  df-ov 7270  df-oprab 7271  df-mpo 7272  df-frecs 8084  df-wrecs 8115  df-recs 8189  df-rdg 8228  df-seq 13732  df-sum 15408
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator