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

Theorem nfsum 15724
Description: Bound-variable hypothesis builder for sum: if 𝑥 is (effectively) not free in 𝐴 and 𝐵, it is not free in Σ𝑘𝐴𝐵. Version of nfsum 15724 with a disjoint variable condition, which does not require ax-13 2375. (Contributed by NM, 11-Dec-2005.) (Revised by GG, 24-Feb-2024.)
Hypotheses
Ref Expression
nfsum.1 𝑥𝐴
nfsum.2 𝑥𝐵
Assertion
Ref Expression
nfsum 𝑥Σ𝑘𝐴 𝐵
Distinct variable group:   𝑥,𝑘
Allowed substitution hints:   𝐴(𝑥,𝑘)   𝐵(𝑥,𝑘)

Proof of Theorem nfsum
Dummy variables 𝑓 𝑚 𝑛 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sum 15720 . 2 Σ𝑘𝐴 𝐵 = (℩𝑧(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
2 nfcv 2903 . . . . 5 𝑥
3 nfsum.1 . . . . . . 7 𝑥𝐴
4 nfcv 2903 . . . . . . 7 𝑥(ℤ𝑚)
53, 4nfss 3988 . . . . . 6 𝑥 𝐴 ⊆ (ℤ𝑚)
6 nfcv 2903 . . . . . . . 8 𝑥𝑚
7 nfcv 2903 . . . . . . . 8 𝑥 +
83nfcri 2895 . . . . . . . . . 10 𝑥 𝑛𝐴
9 nfcv 2903 . . . . . . . . . . 11 𝑥𝑛
10 nfsum.2 . . . . . . . . . . 11 𝑥𝐵
119, 10nfcsbw 3935 . . . . . . . . . 10 𝑥𝑛 / 𝑘𝐵
12 nfcv 2903 . . . . . . . . . 10 𝑥0
138, 11, 12nfif 4561 . . . . . . . . 9 𝑥if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)
142, 13nfmpt 5255 . . . . . . . 8 𝑥(𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))
156, 7, 14nfseq 14049 . . . . . . 7 𝑥seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)))
16 nfcv 2903 . . . . . . 7 𝑥
17 nfcv 2903 . . . . . . 7 𝑥𝑧
1815, 16, 17nfbr 5195 . . . . . 6 𝑥seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧
195, 18nfan 1897 . . . . 5 𝑥(𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧)
202, 19nfrexw 3311 . . . 4 𝑥𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧)
21 nfcv 2903 . . . . 5 𝑥
22 nfcv 2903 . . . . . . . 8 𝑥𝑓
23 nfcv 2903 . . . . . . . 8 𝑥(1...𝑚)
2422, 23, 3nff1o 6847 . . . . . . 7 𝑥 𝑓:(1...𝑚)–1-1-onto𝐴
25 nfcv 2903 . . . . . . . . . 10 𝑥1
26 nfcv 2903 . . . . . . . . . . . 12 𝑥(𝑓𝑛)
2726, 10nfcsbw 3935 . . . . . . . . . . 11 𝑥(𝑓𝑛) / 𝑘𝐵
2821, 27nfmpt 5255 . . . . . . . . . 10 𝑥(𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
2925, 7, 28nfseq 14049 . . . . . . . . 9 𝑥seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))
3029, 6nffv 6917 . . . . . . . 8 𝑥(seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3130nfeq2 2921 . . . . . . 7 𝑥 𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)
3224, 31nfan 1897 . . . . . 6 𝑥(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3332nfex 2323 . . . . 5 𝑥𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3421, 33nfrexw 3311 . . . 4 𝑥𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))
3520, 34nfor 1902 . . 3 𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚)))
3635nfiotaw 6520 . 2 𝑥(℩𝑧(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑧) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑧 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵))‘𝑚))))
371, 36nfcxfr 2901 1 𝑥Σ𝑘𝐴 𝐵
Colors of variables: wff setvar class
Syntax hints:  wa 395  wo 847   = wceq 1537  wex 1776  wcel 2106  wnfc 2888  wrex 3068  csb 3908  wss 3963  ifcif 4531   class class class wbr 5148  cmpt 5231  cio 6514  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  0cc0 11153  1c1 11154   + caddc 11156  cn 12264  cz 12611  cuz 12876  ...cfz 13544  seqcseq 14039  cli 15517  Σcsu 15719
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-seq 14040  df-sum 15720
This theorem is referenced by:  fsum2dlem  15803  fsumcom2  15807  fsumrlim  15844  fsumiun  15854  fsumcn  24908  fsum2cn  24909  nfitg1  25824  nfitg  25825  dvmptfsum  26028  fsumdvdscom  27243  binomcxplemdvsum  44351  binomcxplemnotnn0  44352  fsumcnf  44959  fsumiunss  45531  dvmptfprod  45901  sge0iunmptlemre  46371
  Copyright terms: Public domain W3C validator