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

Theorem nfsum1 10193
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.
StepHypRef Expression
1 df-sum 10191 . 2 Σ𝑘𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚))))
2 nfcv 2219 . . . . 5 𝑘
3 nfsum1.1 . . . . . . 7 𝑘𝐴
4 nfcv 2219 . . . . . . 7 𝑘(ℤ𝑚)
53, 4nfss 2992 . . . . . 6 𝑘 𝐴 ⊆ (ℤ𝑚)
6 nfcv 2219 . . . . . . . 8 𝑘𝑚
7 nfcv 2219 . . . . . . . 8 𝑘 +
83nfcri 2213 . . . . . . . . . 10 𝑘 𝑛𝐴
9 nfcsb1v 2938 . . . . . . . . . 10 𝑘𝑛 / 𝑘𝐵
10 nfcv 2219 . . . . . . . . . 10 𝑘0
118, 9, 10nfif 3377 . . . . . . . . 9 𝑘if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)
122, 11nfmpt 3870 . . . . . . . 8 𝑘(𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))
13 nfcv 2219 . . . . . . . 8 𝑘
146, 7, 12, 13nfiseq 9438 . . . . . . 7 𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ)
15 nfcv 2219 . . . . . . 7 𝑘
16 nfcv 2219 . . . . . . 7 𝑘𝑥
1714, 15, 16nfbr 3829 . . . . . 6 𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥
185, 17nfan 1497 . . . . 5 𝑘(𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥)
192, 18nfrexya 2405 . . . 4 𝑘𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥)
20 nfcv 2219 . . . . 5 𝑘
21 nfcv 2219 . . . . . . . 8 𝑘𝑓
22 nfcv 2219 . . . . . . . 8 𝑘(1...𝑚)
2321, 22, 3nff1o 5144 . . . . . . 7 𝑘 𝑓:(1...𝑚)–1-1-onto𝐴
24 nfcv 2219 . . . . . . . . . 10 𝑘1
25 nfcsb1v 2938 . . . . . . . . . . 11 𝑘(𝑓𝑛) / 𝑘𝐵
2620, 25nfmpt 3870 . . . . . . . . . 10 𝑘(𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵)
2724, 7, 26, 13nfiseq 9438 . . . . . . . . 9 𝑘seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)
2827, 6nffv 5205 . . . . . . . 8 𝑘(seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚)
2928nfeq2 2230 . . . . . . 7 𝑘 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚)
3023, 29nfan 1497 . . . . . 6 𝑘(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚))
3130nfex 1568 . . . . 5 𝑘𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚))
3220, 31nfrexya 2405 . . . 4 𝑘𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚))
3319, 32nfor 1506 . . 3 𝑘(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚)))
3433nfiotaxy 4891 . 2 𝑘(℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)), ℂ) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ (𝑓𝑛) / 𝑘𝐵), ℂ)‘𝑚))))
351, 34nfcxfr 2216 1 𝑘Σ𝑘𝐴 𝐵
Colors of variables: wff set class
Syntax hints:  wa 102  wo 661   = wceq 1284  wex 1421  wcel 1433  wnfc 2206  wrex 2349  csb 2908  wss 2973  ifcif 3351   class class class wbr 3785  cmpt 3839  cio 4885  1-1-ontowf1o 4921  cfv 4922  (class class class)co 5532  cc 6979  0cc0 6981  1c1 6982   + caddc 6984  cn 8039  cz 8351  cuz 8619  ...cfz 9029  seqcseq 9431  cli 10117  Σcsu 10190
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-if 3352  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-recs 5943  df-frec 6001  df-iseq 9432  df-sum 10191
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator