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

Theorem gsumpropd 12975
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 2194 . . . . . . 7 (𝜑 → (Base‘𝐺) = (Base‘𝐺))
2 gsumpropd.b . . . . . . 7 (𝜑 → (Base‘𝐺) = (Base‘𝐻))
3 gsumpropd.g . . . . . . 7 (𝜑𝐺𝑊)
4 gsumpropd.h . . . . . . 7 (𝜑𝐻𝑋)
5 gsumpropd.p . . . . . . . 8 (𝜑 → (+g𝐺) = (+g𝐻))
65oveqdr 5946 . . . . . . 7 ((𝜑 ∧ (𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺))) → (𝑎(+g𝐺)𝑏) = (𝑎(+g𝐻)𝑏))
71, 2, 3, 4, 6grpidpropdg 12957 . . . . . 6 (𝜑 → (0g𝐺) = (0g𝐻))
87eqeq2d 2205 . . . . 5 (𝜑 → (𝑥 = (0g𝐺) ↔ 𝑥 = (0g𝐻)))
98anbi2d 464 . . . 4 (𝜑 → ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ↔ (dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻))))
105seqeq2d 10525 . . . . . . . . 9 (𝜑 → seq𝑚((+g𝐺), 𝐹) = seq𝑚((+g𝐻), 𝐹))
1110fveq1d 5556 . . . . . . . 8 (𝜑 → (seq𝑚((+g𝐺), 𝐹)‘𝑛) = (seq𝑚((+g𝐻), 𝐹)‘𝑛))
1211eqeq2d 2205 . . . . . . 7 (𝜑 → (𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛) ↔ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))
1312anbi2d 464 . . . . . 6 (𝜑 → ((dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ (dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1413rexbidv 2495 . . . . 5 (𝜑 → (∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
1514exbidv 1836 . . . 4 (𝜑 → (∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)) ↔ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛))))
169, 15orbi12d 794 . . 3 (𝜑 → (((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛))) ↔ ((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
1716iotabidv 5237 . 2 (𝜑 → (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)))) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
18 eqid 2193 . . 3 (Base‘𝐺) = (Base‘𝐺)
19 eqid 2193 . . 3 (0g𝐺) = (0g𝐺)
20 eqid 2193 . . 3 (+g𝐺) = (+g𝐺)
21 gsumpropd.f . . 3 (𝜑𝐹𝑉)
22 eqidd 2194 . . 3 (𝜑 → dom 𝐹 = dom 𝐹)
2318, 19, 20, 3, 21, 22igsumvalx 12972 . 2 (𝜑 → (𝐺 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐺)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐺), 𝐹)‘𝑛)))))
24 eqid 2193 . . 3 (Base‘𝐻) = (Base‘𝐻)
25 eqid 2193 . . 3 (0g𝐻) = (0g𝐻)
26 eqid 2193 . . 3 (+g𝐻) = (+g𝐻)
2724, 25, 26, 4, 21, 22igsumvalx 12972 . 2 (𝜑 → (𝐻 Σg 𝐹) = (℩𝑥((dom 𝐹 = ∅ ∧ 𝑥 = (0g𝐻)) ∨ ∃𝑚𝑛 ∈ (ℤ𝑚)(dom 𝐹 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g𝐻), 𝐹)‘𝑛)))))
2817, 23, 273eqtr4d 2236 1 (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 709   = wceq 1364  wex 1503  wcel 2164  wrex 2473  c0 3446  dom cdm 4659  cio 5213  cfv 5254  (class class class)co 5918  cuz 9592  ...cfz 10074  seqcseq 10518  Basecbs 12618  +gcplusg 12695  0gc0g 12867   Σg cgsu 12868
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-recs 6358  df-frec 6444  df-neg 8193  df-inn 8983  df-z 9318  df-uz 9593  df-seqfrec 10519  df-ndx 12621  df-slot 12622  df-base 12624  df-0g 12869  df-igsum 12870
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator