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

Theorem gsum0g 13609
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 2232 . . 3 (Base‘𝐺) = (Base‘𝐺)
2 gsum0.z . . 3 0 = (0g𝐺)
3 eqid 2232 . . 3 (+g𝐺) = (+g𝐺)
4 id 19 . . 3 (𝐺𝑉𝐺𝑉)
5 0ex 4237 . . . 4 ∅ ∈ V
65a1i 9 . . 3 (𝐺𝑉 → ∅ ∈ V)
7 f0 5558 . . . 4 ∅:∅⟶(Base‘𝐺)
87a1i 9 . . 3 (𝐺𝑉 → ∅:∅⟶(Base‘𝐺))
91, 2, 3, 4, 6, 8igsumval 13603 . 2 (𝐺𝑉 → (𝐺 Σg ∅) = (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))))
10 eqidd 2233 . . . . 5 (𝐺𝑉 → ∅ = ∅)
11 eqidd 2233 . . . . 5 (𝐺𝑉0 = 0 )
1210, 11jca 306 . . . 4 (𝐺𝑉 → (∅ = ∅ ∧ 0 = 0 ))
1312orcd 741 . . 3 (𝐺𝑉 → ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
14 fn0g 13588 . . . . . 6 0g Fn V
15 elex 2825 . . . . . 6 (𝐺𝑉𝐺 ∈ V)
16 funfvex 5687 . . . . . . 7 ((Fun 0g𝐺 ∈ dom 0g) → (0g𝐺) ∈ V)
1716funfni 5458 . . . . . 6 ((0g Fn V ∧ 𝐺 ∈ V) → (0g𝐺) ∈ V)
1814, 15, 17sylancr 414 . . . . 5 (𝐺𝑉 → (0g𝐺) ∈ V)
192, 18eqeltrid 2319 . . . 4 (𝐺𝑉0 ∈ V)
20 eueq 2988 . . . . . 6 ( 0 ∈ V ↔ ∃!𝑥 𝑥 = 0 )
21 eqid 2232 . . . . . . . . 9 ∅ = ∅
2221biantrur 303 . . . . . . . 8 (𝑥 = 0 ↔ (∅ = ∅ ∧ 𝑥 = 0 ))
23 eluzfz1 10365 . . . . . . . . . . . . . 14 (𝑛 ∈ (ℤ𝑚) → 𝑚 ∈ (𝑚...𝑛))
24 n0i 3514 . . . . . . . . . . . . . 14 (𝑚 ∈ (𝑚...𝑛) → ¬ (𝑚...𝑛) = ∅)
2523, 24syl 14 . . . . . . . . . . . . 13 (𝑛 ∈ (ℤ𝑚) → ¬ (𝑚...𝑛) = ∅)
2625neqcomd 2237 . . . . . . . . . . . 12 (𝑛 ∈ (ℤ𝑚) → ¬ ∅ = (𝑚...𝑛))
2726intnanrd 940 . . . . . . . . . . 11 (𝑛 ∈ (ℤ𝑚) → ¬ (∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)))
2827nrex 2634 . . . . . . . . . 10 ¬ ∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))
2928nex 1549 . . . . . . . . 9 ¬ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))
3029biorfi 754 . . . . . . . 8 ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3122, 30bitri 184 . . . . . . 7 (𝑥 = 0 ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3231eubii 2089 . . . . . 6 (∃!𝑥 𝑥 = 0 ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3320, 32bitri 184 . . . . 5 ( 0 ∈ V ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3419, 33sylib 122 . . . 4 (𝐺𝑉 → ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
35 eqeq1 2239 . . . . . . 7 (𝑥 = 0 → (𝑥 = 00 = 0 ))
3635anbi2d 464 . . . . . 6 (𝑥 = 0 → ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ (∅ = ∅ ∧ 0 = 0 )))
37 eqeq1 2239 . . . . . . . . 9 (𝑥 = 0 → (𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛) ↔ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛)))
3837anbi2d 464 . . . . . . . 8 (𝑥 = 0 → ((∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ (∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
3938rexbidv 2543 . . . . . . 7 (𝑥 = 0 → (∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
4039exbidv 1874 . . . . . 6 (𝑥 = 0 → (∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛)) ↔ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛))))
4136, 40orbi12d 801 . . . . 5 (𝑥 = 0 → (((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), ∅)‘𝑛))) ↔ ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g𝐺), ∅)‘𝑛)))))
4241iota2 5342 . . . 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 2265 1 (𝐺𝑉 → (𝐺 Σg ∅) = 0 )
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716   = wceq 1398  wex 1541  ∃!weu 2080  wcel 2203  wrex 2521  Vcvv 2813  c0 3508  cio 5310   Fn wfn 5347  wf 5348  cfv 5352  (class class class)co 6050  cuz 9853  ...cfz 10342  seqcseq 10809  Basecbs 13212  +gcplusg 13290  0gc0g 13469   Σg cgsu 13470
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224  ax-pre-ltirr 8239
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-recs 6536  df-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-neg 8447  df-inn 9238  df-z 9578  df-uz 9854  df-fz 10343  df-seqfrec 10810  df-ndx 13215  df-slot 13216  df-base 13218  df-0g 13471  df-igsum 13472
This theorem is referenced by:  gsumwsubmcl  13709  gsumwmhm  13711  mulgnn0gsum  13845  gsumsplit0  14063  gsumfzfsumlem0  14734  gfsumval  16862  gfsum0  16864  gsumgfsum  16866
  Copyright terms: Public domain W3C validator