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

Theorem dfgrp3 18192
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 18121 . . 3 (𝐺 ∈ Grp → 𝐺 ∈ Smgrp)
2 dfgrp3.b . . . 4 𝐵 = (Base‘𝐺)
32grpbn0 18126 . . 3 (𝐺 ∈ Grp → 𝐵 ≠ ∅)
4 simpl 485 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝐺 ∈ Grp)
5 simpr 487 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑦𝐵)
65adantl 484 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
7 simpl 485 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑥𝐵)
87adantl 484 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
9 eqid 2821 . . . . . . . 8 (-g𝐺) = (-g𝐺)
102, 9grpsubcl 18173 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
114, 6, 8, 10syl3anc 1367 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
12 oveq1 7157 . . . . . . . 8 (𝑙 = (𝑦(-g𝐺)𝑥) → (𝑙 + 𝑥) = ((𝑦(-g𝐺)𝑥) + 𝑥))
1312eqeq1d 2823 . . . . . . 7 (𝑙 = (𝑦(-g𝐺)𝑥) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
1413adantl 484 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑙 = (𝑦(-g𝐺)𝑥)) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
15 dfgrp3.p . . . . . . . 8 + = (+g𝐺)
162, 15, 9grpnpcan 18185 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
174, 6, 8, 16syl3anc 1367 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
1811, 14, 17rspcedvd 3626 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦)
19 eqid 2821 . . . . . . . . 9 (invg𝐺) = (invg𝐺)
202, 19grpinvcl 18145 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
2120adantrr 715 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((invg𝐺)‘𝑥) ∈ 𝐵)
222, 15grpcl 18105 . . . . . . 7 ((𝐺 ∈ Grp ∧ ((invg𝐺)‘𝑥) ∈ 𝐵𝑦𝐵) → (((invg𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
234, 21, 6, 22syl3anc 1367 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (((invg𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
24 oveq2 7158 . . . . . . . 8 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → (𝑥 + 𝑟) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
2524eqeq1d 2823 . . . . . . 7 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
2625adantl 484 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑟 = (((invg𝐺)‘𝑥) + 𝑦)) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
27 eqid 2821 . . . . . . . . . 10 (0g𝐺) = (0g𝐺)
282, 15, 27, 19grprinv 18147 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
2928adantrr 715 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
3029oveq1d 7165 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = ((0g𝐺) + 𝑦))
312, 15grpass 18106 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵 ∧ ((invg𝐺)‘𝑥) ∈ 𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
324, 8, 21, 6, 31syl13anc 1368 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
33 grpmnd 18104 . . . . . . . 8 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
342, 15, 27mndlid 17925 . . . . . . . 8 ((𝐺 ∈ Mnd ∧ 𝑦𝐵) → ((0g𝐺) + 𝑦) = 𝑦)
3533, 5, 34syl2an 597 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((0g𝐺) + 𝑦) = 𝑦)
3630, 32, 353eqtr3d 2864 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦)
3723, 26, 36rspcedvd 3626 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)
3818, 37jca 514 . . . 4 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
3938ralrimivva 3191 . . 3 (𝐺 ∈ Grp → ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
401, 3, 393jca 1124 . 2 (𝐺 ∈ Grp → (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
41 simp1 1132 . . 3 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Smgrp)
422, 15dfgrp3lem 18191 . . 3 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢))
432, 15dfgrp2 18122 . . 3 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢)))
4441, 42, 43sylanbrc 585 . 2 ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Grp)
4540, 44impbii 211 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  w3a 1083   = wceq 1533  wcel 2110  wne 3016  wral 3138  wrex 3139  c0 4291  cfv 6350  (class class class)co 7150  Basecbs 16477  +gcplusg 16559  0gc0g 16707  Smgrpcsgrp 17894  Mndcmnd 17905  Grpcgrp 18097  invgcminusg 18098  -gcsg 18099
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-0g 16709  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-grp 18100  df-minusg 18101  df-sbg 18102
This theorem is referenced by:  dfgrp3e  18193
  Copyright terms: Public domain W3C validator