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

Theorem gsumpropd 13536
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 6056 . . . . . . 7 ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g𝐺)𝑏) = (𝑎(+g𝐻)𝑏))
71, 2, 3, 4, 6grpidpropdg 13518 . . . . . 6 (𝜑 → (0g𝐺) = (0g𝐻))
87eqeq2d 2243 . . . . 5 (𝜑 → (𝑥 = (0g𝐺) ↔ 𝑥 = (0g𝐻)))
98anbi2d 464 . . . 4 (𝜑 → ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ↔ (dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻))))
105seqeq2d 10760 . . . . . . . . 9 (𝜑 → seq𝑚((+g𝐺), 𝐹) = seq𝑚((+g𝐻), 𝐹))
1110fveq1d 5650 . . . . . . . 8 (𝜑 → (seq𝑚((+g𝐺), 𝐹)‘𝑛) = (seq𝑚((+g𝐻), 𝐹)‘𝑛))
1211eqeq2d 2243 . . . . . . 7 (𝜑 → (𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))
1312anbi2d 464 . . . . . 6 (𝜑 → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1413rexbidv 2534 . . . . 5 (𝜑 → (∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1514exbidv 1873 . . . 4 (𝜑 → (∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
169, 15orbi12d 801 . . 3 (𝜑 → (((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛))) ↔ ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
1716iotabidv 5316 . 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 13533 . 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 13533 . 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 716   = wceq 1398  wex 1541  wcel 2202  wrex 2512  c0 3496  dom cdm 4731  cio 5291  cfv 5333  (class class class)co 6028  cuz 9798  ...cfz 10286  seqcseq 10753  Basecbs 13143  +gcplusg 13221  0gc0g 13400   Σg cgsu 13401
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-recs 6514  df-frec 6600  df-neg 8396  df-inn 9187  df-z 9523  df-uz 9799  df-seqfrec 10754  df-ndx 13146  df-slot 13147  df-base 13149  df-0g 13402  df-igsum 13403
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator