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

Theorem grpinvpropd 18163
 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 17861 . . . . . . . 8 (𝜑 → (0g𝐾) = (0g𝐿))
54adantr 484 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (0g𝐾) = (0g𝐿))
61, 5eqeq12d 2840 . . . . . 6 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥(+g𝐾)𝑦) = (0g𝐾) ↔ (𝑥(+g𝐿)𝑦) = (0g𝐿)))
76anass1rs 654 . . . . 5 (((𝜑𝑦𝐵) ∧ 𝑥𝐵) → ((𝑥(+g𝐾)𝑦) = (0g𝐾) ↔ (𝑥(+g𝐿)𝑦) = (0g𝐿)))
87riotabidva 7115 . . . 4 ((𝜑𝑦𝐵) → (𝑥𝐵 (𝑥(+g𝐾)𝑦) = (0g𝐾)) = (𝑥𝐵 (𝑥(+g𝐿)𝑦) = (0g𝐿)))
98mpteq2dva 5142 . . 3 (𝜑 → (𝑦𝐵 ↦ (𝑥𝐵 (𝑥(+g𝐾)𝑦) = (0g𝐾))) = (𝑦𝐵 ↦ (𝑥𝐵 (𝑥(+g𝐿)𝑦) = (0g𝐿))))
102riotaeqdv 7097 . . . 4 (𝜑 → (𝑥𝐵 (𝑥(+g𝐾)𝑦) = (0g𝐾)) = (𝑥 ∈ (Base‘𝐾)(𝑥(+g𝐾)𝑦) = (0g𝐾)))
112, 10mpteq12dv 5132 . . 3 (𝜑 → (𝑦𝐵 ↦ (𝑥𝐵 (𝑥(+g𝐾)𝑦) = (0g𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (𝑥 ∈ (Base‘𝐾)(𝑥(+g𝐾)𝑦) = (0g𝐾))))
123riotaeqdv 7097 . . . 4 (𝜑 → (𝑥𝐵 (𝑥(+g𝐿)𝑦) = (0g𝐿)) = (𝑥 ∈ (Base‘𝐿)(𝑥(+g𝐿)𝑦) = (0g𝐿)))
133, 12mpteq12dv 5132 . . 3 (𝜑 → (𝑦𝐵 ↦ (𝑥𝐵 (𝑥(+g𝐿)𝑦) = (0g𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (𝑥 ∈ (Base‘𝐿)(𝑥(+g𝐿)𝑦) = (0g𝐿))))
149, 11, 133eqtr3d 2867 . 2 (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (𝑥 ∈ (Base‘𝐾)(𝑥(+g𝐾)𝑦) = (0g𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (𝑥 ∈ (Base‘𝐿)(𝑥(+g𝐿)𝑦) = (0g𝐿))))
15 eqid 2824 . . 3 (Base‘𝐾) = (Base‘𝐾)
16 eqid 2824 . . 3 (+g𝐾) = (+g𝐾)
17 eqid 2824 . . 3 (0g𝐾) = (0g𝐾)
18 eqid 2824 . . 3 (invg𝐾) = (invg𝐾)
1915, 16, 17, 18grpinvfval 18131 . 2 (invg𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (𝑥 ∈ (Base‘𝐾)(𝑥(+g𝐾)𝑦) = (0g𝐾)))
20 eqid 2824 . . 3 (Base‘𝐿) = (Base‘𝐿)
21 eqid 2824 . . 3 (+g𝐿) = (+g𝐿)
22 eqid 2824 . . 3 (0g𝐿) = (0g𝐿)
23 eqid 2824 . . 3 (invg𝐿) = (invg𝐿)
2420, 21, 22, 23grpinvfval 18131 . 2 (invg𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (𝑥 ∈ (Base‘𝐿)(𝑥(+g𝐿)𝑦) = (0g𝐿)))
2514, 19, 243eqtr4g 2884 1 (𝜑 → (invg𝐾) = (invg𝐿))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115   ↦ cmpt 5127  ‘cfv 6336  ℩crio 7095  (class class class)co 7138  Basecbs 16472  +gcplusg 16554  0gc0g 16702  invgcminusg 18093 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5184  ax-nul 5191  ax-pow 5247  ax-pr 5311  ax-un 7444 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3014  df-ral 3137  df-rex 3138  df-reu 3139  df-rab 3141  df-v 3481  df-sbc 3758  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-nul 4275  df-if 4449  df-pw 4522  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-br 5048  df-opab 5110  df-mpt 5128  df-id 5441  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-fv 6344  df-riota 7096  df-ov 7141  df-0g 16704  df-minusg 18096 This theorem is referenced by:  grpsubpropd  18193  grpsubpropd2  18194  mulgpropd  18258  invrpropd  19437  rlmvneg  19966  matinvg  21013  tngngp3  23251
 Copyright terms: Public domain W3C validator