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

Theorem nfsum1 12122
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-sumdc 12120 . 2 Σ𝑘𝐴 𝐵 = (℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚))))
2 nfcv 2392 . . . . 5 𝑘
3 nfsum1.1 . . . . . . 7 𝑘𝐴
4 nfcv 2392 . . . . . . 7 𝑘(ℤ𝑚)
53, 4nfss 3241 . . . . . 6 𝑘 𝐴 ⊆ (ℤ𝑚)
63nfcri 2386 . . . . . . . 8 𝑘 𝑗𝐴
76nfdc 1711 . . . . . . 7 𝑘DECID 𝑗𝐴
84, 7nfralxy 2588 . . . . . 6 𝑘𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴
9 nfcv 2392 . . . . . . . 8 𝑘𝑚
10 nfcv 2392 . . . . . . . 8 𝑘 +
113nfcri 2386 . . . . . . . . . 10 𝑘 𝑛𝐴
12 nfcsb1v 3180 . . . . . . . . . 10 𝑘𝑛 / 𝑘𝐵
13 nfcv 2392 . . . . . . . . . 10 𝑘0
1411, 12, 13nfif 3669 . . . . . . . . 9 𝑘if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)
152, 14nfmpt 4223 . . . . . . . 8 𝑘(𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))
169, 10, 15nfseq 10894 . . . . . . 7 𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0)))
17 nfcv 2392 . . . . . . 7 𝑘
18 nfcv 2392 . . . . . . 7 𝑘𝑥
1916, 17, 18nfbr 4177 . . . . . 6 𝑘seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥
205, 8, 19nf3an 1619 . . . . 5 𝑘(𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥)
212, 20nfrexya 2591 . . . 4 𝑘𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥)
22 nfcv 2392 . . . . 5 𝑘
23 nfcv 2392 . . . . . . . 8 𝑘𝑓
24 nfcv 2392 . . . . . . . 8 𝑘(1...𝑚)
2523, 24, 3nff1o 5637 . . . . . . 7 𝑘 𝑓:(1...𝑚)–1-1-onto𝐴
26 nfcv 2392 . . . . . . . . . 10 𝑘1
27 nfv 1581 . . . . . . . . . . . 12 𝑘 𝑛𝑚
28 nfcsb1v 3180 . . . . . . . . . . . 12 𝑘(𝑓𝑛) / 𝑘𝐵
2927, 28, 13nfif 3669 . . . . . . . . . . 11 𝑘if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)
3022, 29nfmpt 4223 . . . . . . . . . 10 𝑘(𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0))
3126, 10, 30nfseq 10894 . . . . . . . . 9 𝑘seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))
3231, 9nffv 5705 . . . . . . . 8 𝑘(seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚)
3332nfeq2 2404 . . . . . . 7 𝑘 𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚)
3425, 33nfan 1618 . . . . . 6 𝑘(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚))
3534nfex 1690 . . . . 5 𝑘𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚))
3622, 35nfrexya 2591 . . . 4 𝑘𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚))
3721, 36nfor 1627 . . 3 𝑘(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚)))
3837nfiotaw 5341 . 2 𝑘(℩𝑥(∃𝑚 ∈ ℤ (𝐴 ⊆ (ℤ𝑚) ∧ ∀𝑗 ∈ (ℤ𝑚)DECID 𝑗𝐴 ∧ seq𝑚( + , (𝑛 ∈ ℤ ↦ if(𝑛𝐴, 𝑛 / 𝑘𝐵, 0))) ⇝ 𝑥) ∨ ∃𝑚 ∈ ℕ ∃𝑓(𝑓:(1...𝑚)–1-1-onto𝐴𝑥 = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛𝑚, (𝑓𝑛) / 𝑘𝐵, 0)))‘𝑚))))
391, 38nfcxfr 2389 1 𝑘Σ𝑘𝐴 𝐵
Colors of variables:    wff set class
This proof depends on syntax axioms:  wa 104  wo 720  DECID wdc 846  w3a 1009   = wceq 1402  wex 1545  wcel 2209  wnfc 2379  wral 2528  wrex 2529  csb 3147  wss 3220  ifcif 3638   class class class wbr 4130  cmpt 4192  cio 5335  1-1-ontowf1o 5376  cfv 5377  (class class class)co 6085  0cc0 8179  1c1 8180   + caddc 8182  cle 8361  cn 9304  cz 9644  cuz 9921  ...cfz 10411  seqcseq 10884  cli 12044  Σcsu 12119
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-recs 6576  df-frec 6662  df-seqfrec 10885  df-sumdc 12120
This theorem is used by:  mertenslem2  12303
  Copyright terms: Public domain W3C validator