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

Theorem dfgrp3 18190
Description: Alternate definition of a group as semigroup (with at least one element) which is also a quasigroup, i.e. a magma in which solutions 𝑥 and 𝑦 of the equations (𝑎 + 𝑥) = 𝑏 and (𝑥 + 𝑎) = 𝑏 exist. Theorem 3.2 of [Bruck] p. 28. (Contributed by AV, 28-Aug-2021.)
Hypotheses
Ref Expression
dfgrp3.b 𝐵 = (Base‘𝐺)
dfgrp3.p + = (+g𝐺)
Assertion
Ref Expression
dfgrp3 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
Distinct variable groups:   𝐵,𝑙,𝑟,𝑥,𝑦   𝐺,𝑙,𝑟,𝑥,𝑦   + ,𝑙,𝑟,𝑥,𝑦

Proof of Theorem dfgrp3
Dummy variables 𝑎 𝑖 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpsgrp 18119 . . 3 (𝐺 ∈ Grp → 𝐺 ∈ Smgrp)
2 dfgrp3.b . . . 4 𝐵 = (Base‘𝐺)
32grpbn0 18124 . . 3 (𝐺 ∈ Grp → 𝐵 ≠ ∅)
4 simpl 486 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝐺 ∈ Grp)
5 simpr 488 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑦𝐵)
65adantl 485 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
7 simpl 486 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑥𝐵)
87adantl 485 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
9 eqid 2798 . . . . . . . 8 (-g𝐺) = (-g𝐺)
102, 9grpsubcl 18171 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
114, 6, 8, 10syl3anc 1368 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
12 oveq1 7142 . . . . . . . 8 (𝑙 = (𝑦(-g𝐺)𝑥) → (𝑙 + 𝑥) = ((𝑦(-g𝐺)𝑥) + 𝑥))
1312eqeq1d 2800 . . . . . . 7 (𝑙 = (𝑦(-g𝐺)𝑥) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
1413adantl 485 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑙 = (𝑦(-g𝐺)𝑥)) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
15 dfgrp3.p . . . . . . . 8 + = (+g𝐺)
162, 15, 9grpnpcan 18183 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
174, 6, 8, 16syl3anc 1368 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
1811, 14, 17rspcedvd 3574 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦)
19 eqid 2798 . . . . . . . . 9 (invg𝐺) = (invg𝐺)
202, 19grpinvcl 18143 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
2120adantrr 716 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((invg𝐺)‘𝑥) ∈ 𝐵)
222, 15grpcl 18103 . . . . . . 7 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑥) ∈ 𝐵𝑦𝐵) → (((invg𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
234, 21, 6, 22syl3anc 1368 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (((invg𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
24 oveq2 7143 . . . . . . . 8 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → (𝑥 + 𝑟) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
2524eqeq1d 2800 . . . . . . 7 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
2625adantl 485 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑟 = (((invg𝐺)‘𝑥) + 𝑦)) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
27 eqid 2798 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
282, 15, 27, 19grprinv 18145 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
2928adantrr 716 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
3029oveq1d 7150 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = ((0g𝐺) + 𝑦))
312, 15grpass 18104 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵 ∧ ((invg𝐺)‘𝑥) ∈ 𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
324, 8, 21, 6, 31syl13anc 1369 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
33 grpmnd 18102 . . . . . . . 8 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
342, 15, 27mndlid 17923 . . . . . . . 8 ((𝐺 ∈ Mnd ∧ 𝑦𝐵) → ((0g𝐺) + 𝑦) = 𝑦)
3533, 5, 34syl2an 598 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((0g𝐺) + 𝑦) = 𝑦)
3630, 32, 353eqtr3d 2841 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦)
3723, 26, 36rspcedvd 3574 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)
3818, 37jca 515 . . . 4 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
3938ralrimivva 3156 . . 3 (𝐺 ∈ Grp → ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
401, 3, 393jca 1125 . 2 (𝐺 ∈ Grp → (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
41 simp1 1133 . . 3 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Smgrp)
422, 15dfgrp3lem 18189 . . 3 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢))
432, 15dfgrp2 18120 . . 3 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢)))
4441, 42, 43sylanbrc 586 . 2 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Grp)
4540, 44impbii 212 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2111  wne 2987  wral 3106  wrex 3107  c0 4243  cfv 6324  (class class class)co 7135  Basecbs 16475  +gcplusg 16557  0gc0g 16705  Smgrpcsgrp 17892  Mndcmnd 17903  Grpcgrp 18095  invgcminusg 18096  -gcsg 18097
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
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 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-grp 18098  df-minusg 18099  df-sbg 18100
This theorem is referenced by:  dfgrp3e  18191
  Copyright terms: Public domain W3C validator