ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfgrp3m GIF version

Theorem dfgrp3m 13812
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
dfgrp3m (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
Distinct variable groups:   𝐵,𝑙,𝑟,𝑤,𝑥,𝑦   𝐺,𝑙,𝑟,𝑤,𝑥,𝑦   + ,𝑙,𝑟,𝑤,𝑥,𝑦

Proof of Theorem dfgrp3m
Dummy variables 𝑎 𝑖 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpsgrp 13738 . . 3 (𝐺 ∈ Grp → 𝐺 ∈ Smgrp)
2 dfgrp3.b . . . . 5 𝐵 = (Base‘𝐺)
3 eqid 2232 . . . . 5 (0g𝐺) = (0g𝐺)
42, 3grpidcl 13742 . . . 4 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝐵)
5 elex2 2830 . . . 4 ((0g𝐺) ∈ 𝐵 → ∃𝑤 𝑤𝐵)
64, 5syl 14 . . 3 (𝐺 ∈ Grp → ∃𝑤 𝑤𝐵)
7 simpl 109 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝐺 ∈ Grp)
8 simpr 110 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑦𝐵)
98adantl 277 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑦𝐵)
10 simpl 109 . . . . . . . 8 ((𝑥𝐵𝑦𝐵) → 𝑥𝐵)
1110adantl 277 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → 𝑥𝐵)
12 eqid 2232 . . . . . . . 8 (-g𝐺) = (-g𝐺)
132, 12grpsubcl 13793 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
147, 9, 11, 13syl3anc 1274 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑦(-g𝐺)𝑥) ∈ 𝐵)
15 oveq1 6057 . . . . . . . 8 (𝑙 = (𝑦(-g𝐺)𝑥) → (𝑙 + 𝑥) = ((𝑦(-g𝐺)𝑥) + 𝑥))
1615eqeq1d 2241 . . . . . . 7 (𝑙 = (𝑦(-g𝐺)𝑥) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
1716adantl 277 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑙 = (𝑦(-g𝐺)𝑥)) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦))
18 dfgrp3.p . . . . . . . 8 + = (+g𝐺)
192, 18, 12grpnpcan 13805 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑦𝐵𝑥𝐵) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
207, 9, 11, 19syl3anc 1274 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑦(-g𝐺)𝑥) + 𝑥) = 𝑦)
2114, 17, 20rspcedvd 2927 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦)
22 eqid 2232 . . . . . . . . 9 (invg𝐺) = (invg𝐺)
232, 22grpinvcl 13761 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((invg𝐺)‘𝑥) ∈ 𝐵)
2423adantrr 479 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((invg𝐺)‘𝑥) ∈ 𝐵)
252, 18, 7, 24, 9grpcld 13727 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (((invg𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
26 oveq2 6058 . . . . . . . 8 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → (𝑥 + 𝑟) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
2726eqeq1d 2241 . . . . . . 7 (𝑟 = (((invg𝐺)‘𝑥) + 𝑦) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
2827adantl 277 . . . . . 6 (((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) ∧ 𝑟 = (((invg𝐺)‘𝑥) + 𝑦)) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦))
292, 18, 3, 22grprinv 13764 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
3029adantrr 479 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + ((invg𝐺)‘𝑥)) = (0g𝐺))
3130oveq1d 6065 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = ((0g𝐺) + 𝑦))
322, 18grpass 13722 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑥𝐵 ∧ ((invg𝐺)‘𝑥) ∈ 𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
337, 11, 24, 9, 32syl13anc 1276 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥 + ((invg𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)))
34 grpmnd 13720 . . . . . . . 8 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
352, 18, 3mndlid 13648 . . . . . . . 8 ((𝐺 ∈ Mnd ∧ 𝑦𝐵) → ((0g𝐺) + 𝑦) = 𝑦)
3634, 8, 35syl2an 289 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ((0g𝐺) + 𝑦) = 𝑦)
3731, 33, 363eqtr3d 2273 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + (((invg𝐺)‘𝑥) + 𝑦)) = 𝑦)
3825, 28, 37rspcedvd 2927 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)
3921, 38jca 306 . . . 4 ((𝐺 ∈ Grp ∧ (𝑥𝐵𝑦𝐵)) → (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
4039ralrimivva 2624 . . 3 (𝐺 ∈ Grp → ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦))
411, 6, 403jca 1204 . 2 (𝐺 ∈ Grp → (𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
42 simp1 1024 . . 3 ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Smgrp)
432, 18dfgrp3mlem 13811 . . 3 ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢))
442, 18dfgrp2 13740 . . 3 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑢𝐵𝑎𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖𝐵 (𝑖 + 𝑎) = 𝑢)))
4542, 43, 44sylanbrc 417 . 2 ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Grp)
4641, 45impbii 126 1 (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (∃𝑙𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟𝐵 (𝑥 + 𝑟) = 𝑦)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105  w3a 1005   = wceq 1398  wex 1541  wcel 2203  wral 2520  wrex 2521  cfv 5352  (class class class)co 6050  Basecbs 13212  +gcplusg 13290  0gc0g 13469  Smgrpcsgrp 13614  Mndcmnd 13629  Grpcgrp 13713  invgcminusg 13714  -gcsg 13715
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-inn 9238  df-2 9296  df-ndx 13215  df-slot 13216  df-base 13218  df-plusg 13303  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-grp 13716  df-minusg 13717  df-sbg 13718
This theorem is referenced by:  dfgrp3me  13813
  Copyright terms: Public domain W3C validator