MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpinvpropd Structured version   Visualization version   GIF version

Theorem grpinvpropd 19230
Description: If two structures have the same group components (properties), they have the same group inversion function. (Contributed by Mario Carneiro, 27-Nov-2014.) (Revised by Stefan O'Rear, 21-Mar-2015.)
Hypotheses
Ref Expression
grpinvpropd.1 (𝜑 → 𝐵 = (Base‘𝐾))
grpinvpropd.2 (𝜑 → 𝐵 = (Base‘𝐿))
grpinvpropd.3 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
Assertion
Ref Expression
grpinvpropd (𝜑 → (invg‘𝐾) = (invg‘𝐿))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem grpinvpropd
StepHypRef Expression
1 grpinvpropd.3 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
2 grpinvpropd.1 . . . . . . . . 9 (𝜑 → 𝐵 = (Base‘𝐾))
3 grpinvpropd.2 . . . . . . . . 9 (𝜑 → 𝐵 = (Base‘𝐿))
42, 3, 1grpidpropd 18847 . . . . . . . 8 (𝜑 → (0g‘𝐾) = (0g‘𝐿))
54adantr 486 . . . . . . 7 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
61, 5eqeq12d 2776 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
76anass1rs 668 . . . . 5 (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
87riotabidva 7396 . . . 4 ((𝜑 ∧ 𝑦 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
98mpteq2dva 5197 . . 3 (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
102riotaeqdv 7378 . . . 4 (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
112, 10mpteq12dv 5191 . . 3 (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))))
123riotaeqdv 7378 . . . 4 (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)) = (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
133, 12mpteq12dv 5191 . . 3 (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
149, 11, 133eqtr3d 2803 . 2 (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
15 eqid 2760 . . 3 (Base‘𝐾) = (Base‘𝐾)
16 eqid 2760 . . 3 (+g‘𝐾) = (+g‘𝐾)
17 eqid 2760 . . 3 (0g‘𝐾) = (0g‘𝐾)
18 eqid 2760 . . 3 (invg‘𝐾) = (invg‘𝐾)
1915, 16, 17, 18grpinvfval 19194 . 2 (invg‘𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
20 eqid 2760 . . 3 (Base‘𝐿) = (Base‘𝐿)
21 eqid 2760 . . 3 (+g‘𝐿) = (+g‘𝐿)
22 eqid 2760 . . 3 (0g‘𝐿) = (0g‘𝐿)
23 eqid 2760 . . 3 (invg‘𝐿) = (invg‘𝐿)
2420, 21, 22, 23grpinvfval 19194 . 2 (invg‘𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
2514, 19, 243eqtr4g 2820 1 (𝜑 → (invg‘𝐾) = (invg‘𝐿))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ↦ cmpt 5185  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17392  +gcplusg 17433  0gc0g 17615  invgcminusg 19150
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-riota 7377  df-ov 7423  df-0g 17617  df-minusg 19153
This theorem is used by:  grpsubpropd  19260  grpsubpropd2  19261  mulgpropd  19331  invrpropd  20653  rlmvneg  21486  matinvg  22738  tngngp3  24980
  Copyright terms: Public domain W3C validator