Theorem dfgrp3m 13516

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.

Step	Hyp	Ref	Expression
1		grpsgrp 13442	. . 3 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Smgrp)
2		dfgrp3.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
3		eqid 2206	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
4	2, 3	grpidcl 13446	. . . 4 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝐵)
5		elex2 2790	. . . 4 ⊢ ((0g‘𝐺) ∈ 𝐵 → ∃𝑤 𝑤 ∈ 𝐵)
6	4, 5	syl 14	. . 3 ⊢ (𝐺 ∈ Grp → ∃𝑤 𝑤 ∈ 𝐵)
7		simpl 109	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Grp)
8		simpr 110	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
9	8	adantl 277	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
10		simpl 109	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵)
11	10	adantl 277	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
12		eqid 2206	. . . . . . . 8 ⊢ (-g‘𝐺) = (-g‘𝐺)
13	2, 12	grpsubcl 13497	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(-g‘𝐺)𝑥) ∈ 𝐵)
14	7, 9, 11, 13	syl3anc 1250	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦(-g‘𝐺)𝑥) ∈ 𝐵)
15		oveq1 5969	. . . . . . . 8 ⊢ (𝑙 = (𝑦(-g‘𝐺)𝑥) → (𝑙 + 𝑥) = ((𝑦(-g‘𝐺)𝑥) + 𝑥))
16	15	eqeq1d 2215	. . . . . . 7 ⊢ (𝑙 = (𝑦(-g‘𝐺)𝑥) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦))
17	16	adantl 277	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑙 = (𝑦(-g‘𝐺)𝑥)) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦))
18		dfgrp3.p	. . . . . . . 8 ⊢ + = (+g‘𝐺)
19	2, 18, 12	grpnpcan 13509	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦)
20	7, 9, 11, 19	syl3anc 1250	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦)
21	14, 17, 20	rspcedvd 2887	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦)
22		eqid 2206	. . . . . . . . 9 ⊢ (invg‘𝐺) = (invg‘𝐺)
23	2, 22	grpinvcl 13465	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵)
24	23	adantrr 479	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((invg‘𝐺)‘𝑥) ∈ 𝐵)
25	2, 18, 7, 24, 9	grpcld 13431	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((invg‘𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
26		oveq2 5970	. . . . . . . 8 ⊢ (𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦) → (𝑥 + 𝑟) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
27	26	eqeq1d 2215	. . . . . . 7 ⊢ (𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦))
28	27	adantl 277	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦)) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦))
29	2, 18, 3, 22	grprinv 13468	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑥 + ((invg‘𝐺)‘𝑥)) = (0g‘𝐺))
30	29	adantrr 479	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + ((invg‘𝐺)‘𝑥)) = (0g‘𝐺))
31	30	oveq1d 5977	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = ((0g‘𝐺) + 𝑦))
32	2, 18	grpass 13426	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
33	7, 11, 24, 9, 32	syl13anc 1252	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
34		grpmnd 13424	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
35	2, 18, 3	mndlid 13352	. . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → ((0g‘𝐺) + 𝑦) = 𝑦)
36	34, 8, 35	syl2an 289	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((0g‘𝐺) + 𝑦) = 𝑦)
37	31, 33, 36	3eqtr3d 2247	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦)
38	25, 28, 37	rspcedvd 2887	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)
39	21, 38	jca 306	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦))
40	39	ralrimivva 2589	. . 3 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦))
41	1, 6, 40	3jca 1180	. 2 ⊢ (𝐺 ∈ Grp → (𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)))
42		simp1 1000	. . 3 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Smgrp)
43	2, 18	dfgrp3mlem 13515	. . 3 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → ∃𝑢 ∈ 𝐵 ∀𝑎 ∈ 𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑎) = 𝑢))
44	2, 18	dfgrp2 13444	. . 3 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑢 ∈ 𝐵 ∀𝑎 ∈ 𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑎) = 𝑢)))
45	42, 43, 44	sylanbrc 417	. 2 ⊢ ((𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Grp)
46	41, 45	impbii 126	1 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑤 𝑤 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)))

Syntax hints:   ∧ wa 104   ↔ wb 105   ∧ w3a 981   = wceq 1373  ∃wex 1516   ∈ wcel 2177  ∀wral 2485  ∃wrex 2486  ‘cfv 5285  (class class class)co 5962  Basecbs 12917  +_gcplusg 12994  0_gc0g 13173  Smgrpcsgrp 13318  Mndcmnd 13333  Grpcgrp 13417  inv_gcminusg 13418  -_gcsg 13419

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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4170  ax-sep 4173  ax-pow 4229  ax-pr 4264  ax-un 4493  ax-setind 4598  ax-cnex 8046  ax-resscn 8047  ax-1re 8049  ax-addrcl 8052

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3003  df-csb 3098  df-dif 3172  df-un 3174  df-in 3176  df-ss 3183  df-pw 3623  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3860  df-int 3895  df-iun 3938  df-br 4055  df-opab 4117  df-mpt 4118  df-id 4353  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-iota 5246  df-fun 5287  df-fn 5288  df-f 5289  df-f1 5290  df-fo 5291  df-f1o 5292  df-fv 5293  df-riota 5917  df-ov 5965  df-oprab 5966  df-mpo 5967  df-1st 6244  df-2nd 6245  df-inn 9067  df-2 9125  df-ndx 12920  df-slot 12921  df-base 12923  df-plusg 13007  df-0g 13175  df-mgm 13273  df-sgrp 13319  df-mnd 13334  df-grp 13420  df-minusg 13421  df-sbg 13422

This theorem is referenced by:  dfgrp3me  13517