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

Theorem grpidinv 18807
Description: A group has a left and right identity element, and every member has a left and right inverse. (Contributed by NM, 14-Oct-2006.) (Revised by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grpidinv.b 𝐵 = (Base‘𝐺)
grpidinv.p + = (+g𝐺)
Assertion
Ref Expression
grpidinv (𝐺 ∈ Grp → ∃𝑢𝐵𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)))
Distinct variable groups:   𝑢,𝐺,𝑥,𝑦   𝑢,𝐵,𝑦   𝑢, + ,𝑦
Allowed substitution hints:   𝐵(𝑥)   + (𝑥)

Proof of Theorem grpidinv
StepHypRef Expression
1 grpidinv.b . . 3 𝐵 = (Base‘𝐺)
2 eqid 2736 . . 3 (0g𝐺) = (0g𝐺)
31, 2grpidcl 18778 . 2 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝐵)
4 oveq1 7364 . . . . . . 7 (𝑢 = (0g𝐺) → (𝑢 + 𝑥) = ((0g𝐺) + 𝑥))
54eqeq1d 2738 . . . . . 6 (𝑢 = (0g𝐺) → ((𝑢 + 𝑥) = 𝑥 ↔ ((0g𝐺) + 𝑥) = 𝑥))
6 oveq2 7365 . . . . . . 7 (𝑢 = (0g𝐺) → (𝑥 + 𝑢) = (𝑥 + (0g𝐺)))
76eqeq1d 2738 . . . . . 6 (𝑢 = (0g𝐺) → ((𝑥 + 𝑢) = 𝑥 ↔ (𝑥 + (0g𝐺)) = 𝑥))
85, 7anbi12d 631 . . . . 5 (𝑢 = (0g𝐺) → (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ↔ (((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥)))
9 eqeq2 2748 . . . . . . 7 (𝑢 = (0g𝐺) → ((𝑦 + 𝑥) = 𝑢 ↔ (𝑦 + 𝑥) = (0g𝐺)))
10 eqeq2 2748 . . . . . . 7 (𝑢 = (0g𝐺) → ((𝑥 + 𝑦) = 𝑢 ↔ (𝑥 + 𝑦) = (0g𝐺)))
119, 10anbi12d 631 . . . . . 6 (𝑢 = (0g𝐺) → (((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢) ↔ ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
1211rexbidv 3175 . . . . 5 (𝑢 = (0g𝐺) → (∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢) ↔ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
138, 12anbi12d 631 . . . 4 (𝑢 = (0g𝐺) → ((((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
1413ralbidv 3174 . . 3 (𝑢 = (0g𝐺) → (∀𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
1514adantl 482 . 2 ((𝐺 ∈ Grp ∧ 𝑢 = (0g𝐺)) → (∀𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
16 grpidinv.p . . . 4 + = (+g𝐺)
171, 16, 2grpidinv2 18806 . . 3 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
1817ralrimiva 3143 . 2 (𝐺 ∈ Grp → ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
193, 15, 18rspcedvd 3583 1 (𝐺 ∈ Grp → ∃𝑢𝐵𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3064  wrex 3073  cfv 6496  (class class class)co 7357  Basecbs 17083  +gcplusg 17133  0gc0g 17321  Grpcgrp 18748
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-fv 6504  df-riota 7313  df-ov 7360  df-0g 17323  df-mgm 18497  df-sgrp 18546  df-mnd 18557  df-grp 18751  df-minusg 18752
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator