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

Theorem gsum0g 13478
Description: Value of the empty group sum. (Contributed by Mario Carneiro, 7-Dec-2014.)
Hypothesis
Ref Expression
gsum0.z 0 = (0g𝐺)
Assertion
Ref Expression
gsum0g (𝐺𝑉 → (𝐺 Σg ∅) = 0 )

Proof of Theorem gsum0g
Dummy variables 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2231 . . 3 (Base‘𝐺) = (Base‘𝐺)
2 gsum0.z . . 3 0 = (0g𝐺)
3 eqid 2231 . . 3 (+g𝐺) = (+g𝐺)
4 id 19 . . 3 (𝐺𝑉𝐺𝑉)
5 0ex 4216 . . . 4 ∅ ∈ V
65a1i 9 . . 3 (𝐺𝑉 → ∅ ∈ V)
7 f0 5527 . . . 4 ∅:∅⟶(Base‘𝐺)
87a1i 9 . . 3 (𝐺𝑉 → ∅:∅⟶(Base‘𝐺))
91, 2, 3, 4, 6, 8igsumval 13472 . 2 (𝐺𝑉 → (𝐺 Σg ∅) = (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))))
10 eqidd 2232 . . . . 5 (𝐺𝑉 → ∅ = ∅)
11 eqidd 2232 . . . . 5 (𝐺𝑉0 = 0 )
1210, 11jca 306 . . . 4 (𝐺𝑉 → (∅ = ∅ ∧ 0 = 0 ))
1312orcd 740 . . 3 (𝐺𝑉 → ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
14 fn0g 13457 . . . . . 6 0g Fn V
15 elex 2814 . . . . . 6 (𝐺𝑉𝐺 ∈ V)
16 funfvex 5656 . . . . . . 7 ((Fun 0g𝐺 ∈ dom 0g) → (0g𝐺) ∈ V)
1716funfni 5432 . . . . . 6 ((0g Fn V ∧ 𝐺 ∈ V) → (0g𝐺) ∈ V)
1814, 15, 17sylancr 414 . . . . 5 (𝐺𝑉 → (0g𝐺) ∈ V)
192, 18eqeltrid 2318 . . . 4 (𝐺𝑉0 ∈ V)
20 eueq 2977 . . . . . 6 ( 0 ∈ V ↔ ∃!𝑥 𝑥 = 0 )
21 eqid 2231 . . . . . . . . 9 ∅ = ∅
2221biantrur 303 . . . . . . . 8 (𝑥 = 0 ↔ (∅ = ∅ ∧ 𝑥 = 0 ))
23 eluzfz1 10265 . . . . . . . . . . . . . 14 (𝑛 ∈ (ℤ𝑚) → 𝑚 ∈ (𝑚...𝑛))
24 n0i 3500 . . . . . . . . . . . . . 14 (𝑚 ∈ (𝑚...𝑛) → ¬ (𝑚...𝑛) = ∅)
2523, 24syl 14 . . . . . . . . . . . . 13 (𝑛 ∈ (ℤ𝑚) → ¬ (𝑚...𝑛) = ∅)
2625neqcomd 2236 . . . . . . . . . . . 12 (𝑛 ∈ (ℤ𝑚) → ¬ ∅ = (𝑚...𝑛))
2726intnanrd 939 . . . . . . . . . . 11 (𝑛 ∈ (ℤ𝑚) → ¬ (∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))
2827nrex 2624 . . . . . . . . . 10 ¬ ∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))
2928nex 1548 . . . . . . . . 9 ¬ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))
3029biorfi 753 . . . . . . . 8 ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3122, 30bitri 184 . . . . . . 7 (𝑥 = 0 ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3231eubii 2088 . . . . . 6 (∃!𝑥 𝑥 = 0 ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3320, 32bitri 184 . . . . 5 ( 0 ∈ V ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3419, 33sylib 122 . . . 4 (𝐺𝑉 → ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
35 eqeq1 2238 . . . . . . 7 (𝑥 = 0 → (𝑥 = 00 = 0 ))
3635anbi2d 464 . . . . . 6 (𝑥 = 0 → ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ (∅ = ∅ ∧ 0 = 0 )))
37 eqeq1 2238 . . . . . . . . 9 (𝑥 = 0 → (𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛) ↔ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛)))
3837anbi2d 464 . . . . . . . 8 (𝑥 = 0 → ((∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ (∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3938rexbidv 2533 . . . . . . 7 (𝑥 = 0 → (∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
4039exbidv 1873 . . . . . 6 (𝑥 = 0 → (∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
4136, 40orbi12d 800 . . . . 5 (𝑥 = 0 → (((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))) ↔ ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛)))))
4241iota2 5316 . . . 4 (( 0 ∈ V ∧ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))) → (((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))) ↔ (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))) = 0 ))
4319, 34, 42syl2anc 411 . . 3 (𝐺𝑉 → (((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))) ↔ (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))) = 0 ))
4413, 43mpbid 147 . 2 (𝐺𝑉 → (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))) = 0 )
459, 44eqtrd 2264 1 (𝐺𝑉 → (𝐺 Σg ∅) = 0 )
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 715   = wceq 1397  wex 1540  ∃!weu 2079  wcel 2202  wrex 2511  Vcvv 2802  c0 3494  cio 5284   Fn wfn 5321  wf 5322  cfv 5326  (class class class)co 6017  cuz 9754  ...cfz 10242  seqcseq 10708  Basecbs 13081  +gcplusg 13159  0gc0g 13338   Σg cgsu 13339
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128  ax-pre-ltirr 8143
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-neg 8352  df-inn 9143  df-z 9479  df-uz 9755  df-fz 10243  df-seqfrec 10709  df-ndx 13084  df-slot 13085  df-base 13087  df-0g 13340  df-igsum 13341
This theorem is referenced by:  gsumwsubmcl  13578  gsumwmhm  13580  mulgnn0gsum  13714  gsumfzfsumlem0  14599  gfsumval  16680  gfsum0  16682  gsumgfsum  16684
  Copyright terms: Public domain W3C validator