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

Theorem gsumpropd 13480
Description: The group sum depends only on the base set and additive operation. (Contributed by Stefan O'Rear, 1-Feb-2015.) (Proof shortened by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
gsumpropd.f (𝜑𝐹𝑉)
gsumpropd.g (𝜑𝐺𝑊)
gsumpropd.h (𝜑𝐻𝑋)
gsumpropd.b (𝜑 → (Base‘𝐺) = (Base‘𝐻))
gsumpropd.p (𝜑 → (+g𝐺) = (+g𝐻))
Assertion
Ref Expression
gsumpropd (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))

Proof of Theorem gsumpropd
Dummy variables 𝑎 𝑏 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2232 . . . . . . 7 (𝜑 → (Base‘𝐺) = (Base‘𝐺))
2 gsumpropd.b . . . . . . 7 (𝜑 → (Base‘𝐺) = (Base‘𝐻))
3 gsumpropd.g . . . . . . 7 (𝜑𝐺𝑊)
4 gsumpropd.h . . . . . . 7 (𝜑𝐻𝑋)
5 gsumpropd.p . . . . . . . 8 (𝜑 → (+g𝐺) = (+g𝐻))
65oveqdr 6046 . . . . . . 7 ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g𝐺)𝑏) = (𝑎(+g𝐻)𝑏))
71, 2, 3, 4, 6grpidpropdg 13462 . . . . . 6 (𝜑 → (0g𝐺) = (0g𝐻))
87eqeq2d 2243 . . . . 5 (𝜑 → (𝑥 = (0g𝐺) ↔ 𝑥 = (0g𝐻)))
98anbi2d 464 . . . 4 (𝜑 → ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ↔ (dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻))))
105seqeq2d 10717 . . . . . . . . 9 (𝜑 → seq𝑚((+g𝐺), 𝐹) = seq𝑚((+g𝐻), 𝐹))
1110fveq1d 5641 . . . . . . . 8 (𝜑 → (seq𝑚((+g𝐺), 𝐹)‘𝑛) = (seq𝑚((+g𝐻), 𝐹)‘𝑛))
1211eqeq2d 2243 . . . . . . 7 (𝜑 → (𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))
1312anbi2d 464 . . . . . 6 (𝜑 → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1413rexbidv 2533 . . . . 5 (𝜑 → (∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1514exbidv 1873 . . . 4 (𝜑 → (∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
169, 15orbi12d 800 . . 3 (𝜑 → (((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛))) ↔ ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
1716iotabidv 5309 . 2 (𝜑 → (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)))) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
18 eqid 2231 . . 3 (Base‘𝐺) = (Base‘𝐺)
19 eqid 2231 . . 3 (0g𝐺) = (0g𝐺)
20 eqid 2231 . . 3 (+g𝐺) = (+g𝐺)
21 gsumpropd.f . . 3 (𝜑𝐹𝑉)
22 eqidd 2232 . . 3 (𝜑 → dom 𝐹 = dom 𝐹)
2318, 19, 20, 3, 21, 22igsumvalx 13477 . 2 (𝜑 → (𝐺 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)))))
24 eqid 2231 . . 3 (Base‘𝐻) = (Base‘𝐻)
25 eqid 2231 . . 3 (0g𝐻) = (0g𝐻)
26 eqid 2231 . . 3 (+g𝐻) = (+g𝐻)
2724, 25, 26, 4, 21, 22igsumvalx 13477 . 2 (𝜑 → (𝐻 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
2817, 23, 273eqtr4d 2274 1 (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 715   = wceq 1397  wex 1540  wcel 2202  wrex 2511  c0 3494  dom cdm 4725  cio 5284  cfv 5326  (class class class)co 6018  cuz 9755  ...cfz 10243  seqcseq 10710  Basecbs 13087  +gcplusg 13165  0gc0g 13344   Σg cgsu 13345
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-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129
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-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-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 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-recs 6471  df-frec 6557  df-neg 8353  df-inn 9144  df-z 9480  df-uz 9756  df-seqfrec 10711  df-ndx 13090  df-slot 13091  df-base 13093  df-0g 13346  df-igsum 13347
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator