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

Theorem grplrinv 18614
Description: In a group, every member has a left and right inverse. (Contributed by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grplrinv.b 𝐵 = (Base‘𝐺)
grplrinv.p + = (+g𝐺)
grplrinv.i 0 = (0g𝐺)
Assertion
Ref Expression
grplrinv (𝐺 ∈ Grp → ∀𝑥𝐵𝑦𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ))
Distinct variable groups:   𝑦,𝐵   𝑥,𝐺,𝑦   𝑦, +   𝑦, 0
Allowed substitution hints:   𝐵(𝑥)   + (𝑥)   0 (𝑥)

Proof of Theorem grplrinv
StepHypRef Expression
1 grplrinv.b . . . 4 𝐵 = (Base‘𝐺)
2 eqid 2739 . . . 4 (invg𝐺) = (invg𝐺)
31, 2grpinvcl 18608 . . 3 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
4 oveq1 7275 . . . . . 6 (𝑦 = ((invg𝐺)‘𝑥) → (𝑦 + 𝑥) = (((invg𝐺)‘𝑥) + 𝑥))
54eqeq1d 2741 . . . . 5 (𝑦 = ((invg𝐺)‘𝑥) → ((𝑦 + 𝑥) = 0 ↔ (((invg𝐺)‘𝑥) + 𝑥) = 0 ))
6 oveq2 7276 . . . . . 6 (𝑦 = ((invg𝐺)‘𝑥) → (𝑥 + 𝑦) = (𝑥 + ((invg𝐺)‘𝑥)))
76eqeq1d 2741 . . . . 5 (𝑦 = ((invg𝐺)‘𝑥) → ((𝑥 + 𝑦) = 0 ↔ (𝑥 + ((invg𝐺)‘𝑥)) = 0 ))
85, 7anbi12d 630 . . . 4 (𝑦 = ((invg𝐺)‘𝑥) → (((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ) ↔ ((((invg𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg𝐺)‘𝑥)) = 0 )))
98adantl 481 . . 3 (((𝐺 ∈ Grp ∧ 𝑥𝐵) ∧ 𝑦 = ((invg𝐺)‘𝑥)) → (((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ) ↔ ((((invg𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg𝐺)‘𝑥)) = 0 )))
10 grplrinv.p . . . . 5 + = (+g𝐺)
11 grplrinv.i . . . . 5 0 = (0g𝐺)
121, 10, 11, 2grplinv 18609 . . . 4 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (((invg𝐺)‘𝑥) + 𝑥) = 0 )
131, 10, 11, 2grprinv 18610 . . . 4 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝑥 + ((invg𝐺)‘𝑥)) = 0 )
1412, 13jca 511 . . 3 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((((invg𝐺)‘𝑥) + 𝑥) = 0 ∧ (𝑥 + ((invg𝐺)‘𝑥)) = 0 ))
153, 9, 14rspcedvd 3563 . 2 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ∃𝑦𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ))
1615ralrimiva 3109 1 (𝐺 ∈ Grp → ∀𝑥𝐵𝑦𝐵 ((𝑦 + 𝑥) = 0 ∧ (𝑥 + 𝑦) = 0 ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1541  wcel 2109  wral 3065  wrex 3066  cfv 6430  (class class class)co 7268  Basecbs 16893  +gcplusg 16943  0gc0g 17131  Grpcgrp 18558  invgcminusg 18559
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rmo 3073  df-rab 3074  df-v 3432  df-sbc 3720  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-fv 6438  df-riota 7225  df-ov 7271  df-0g 17133  df-mgm 18307  df-sgrp 18356  df-mnd 18367  df-grp 18561  df-minusg 18562
This theorem is referenced by:  grpidinv2  18615
  Copyright terms: Public domain W3C validator