Theorem dfgrp3 19165

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.

Step	Hyp	Ref	Expression
1		grpsgrp 19087	. . 3 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Smgrp)
2		dfgrp3.b	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
3	2	grpbn0 19093	. . 3 ⊢ (𝐺 ∈ Grp → 𝐵 ≠ ∅)
4		simpl 488	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Grp)
5		simpr 490	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
6	5	adantl 487	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
7		simpl 488	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ 𝐵)
8	7	adantl 487	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
9		eqid 2760	. . . . . . . 8 ⊢ (-g‘𝐺) = (-g‘𝐺)
10	2, 9	grpsubcl 19146	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑦(-g‘𝐺)𝑥) ∈ 𝐵)
11	4, 6, 8, 10	syl3anc 1398	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦(-g‘𝐺)𝑥) ∈ 𝐵)
12		oveq1 7421	. . . . . . . 8 ⊢ (𝑙 = (𝑦(-g‘𝐺)𝑥) → (𝑙 + 𝑥) = ((𝑦(-g‘𝐺)𝑥) + 𝑥))
13	12	eqeq1d 2762	. . . . . . 7 ⊢ (𝑙 = (𝑦(-g‘𝐺)𝑥) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦))
14	13	adantl 487	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑙 = (𝑦(-g‘𝐺)𝑥)) → ((𝑙 + 𝑥) = 𝑦 ↔ ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦))
15		dfgrp3.p	. . . . . . . 8 ⊢ + = (+g‘𝐺)
16	2, 15, 9	grpnpcan 19158	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦)
17	4, 6, 8, 16	syl3anc 1398	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦(-g‘𝐺)𝑥) + 𝑥) = 𝑦)
18	11, 14, 17	rspcedvd 3578	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦)
19		eqid 2760	. . . . . . . . 9 ⊢ (invg‘𝐺) = (invg‘𝐺)
20	2, 19	grpinvcl 19114	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵)
21	20	adantrr 730	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((invg‘𝐺)‘𝑥) ∈ 𝐵)
22	2, 15, 4, 21, 6	grpcld 19074	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((invg‘𝐺)‘𝑥) + 𝑦) ∈ 𝐵)
23		oveq2 7422	. . . . . . . 8 ⊢ (𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦) → (𝑥 + 𝑟) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
24	23	eqeq1d 2762	. . . . . . 7 ⊢ (𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦))
25	24	adantl 487	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑟 = (((invg‘𝐺)‘𝑥) + 𝑦)) → ((𝑥 + 𝑟) = 𝑦 ↔ (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦))
26		eqid 2760	. . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺)
27	2, 15, 26, 19	grprinv 19117	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑥 + ((invg‘𝐺)‘𝑥)) = (0g‘𝐺))
28	27	adantrr 730	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + ((invg‘𝐺)‘𝑥)) = (0g‘𝐺))
29	28	oveq1d 7429	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = ((0g‘𝐺) + 𝑦))
30	2, 15	grpass 19069	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
31	4, 8, 21, 6, 30	syl13anc 1399	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 + ((invg‘𝐺)‘𝑥)) + 𝑦) = (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)))
32		grpmnd 19067	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
33	2, 15, 26	mndlid 18860	. . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝑦 ∈ 𝐵) → ((0g‘𝐺) + 𝑦) = 𝑦)
34	32, 5, 33	syl2an 608	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((0g‘𝐺) + 𝑦) = 𝑦)
35	29, 31, 34	3eqtr3d 2803	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + (((invg‘𝐺)‘𝑥) + 𝑦)) = 𝑦)
36	22, 25, 35	rspcedvd 3578	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)
37	18, 36	jca 521	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦))
38	37	ralrimivva 3205	. . 3 ⊢ (𝐺 ∈ Grp → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦))
39	1, 3, 38	3jca 1146	. 2 ⊢ (𝐺 ∈ Grp → (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)))
40		simp1 1154	. . 3 ⊢ ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Smgrp)
41	2, 15	dfgrp3lem 19164	. . 3 ⊢ ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → ∃𝑢 ∈ 𝐵 ∀𝑎 ∈ 𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑎) = 𝑢))
42	2, 15	dfgrp2 19089	. . 3 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ ∃𝑢 ∈ 𝐵 ∀𝑎 ∈ 𝐵 ((𝑢 + 𝑎) = 𝑎 ∧ ∃𝑖 ∈ 𝐵 (𝑖 + 𝑎) = 𝑢)))
43	40, 41, 42	sylanbrc 595	. 2 ⊢ ((𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)) → 𝐺 ∈ Grp)
44	39, 43	impbii 212	1 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Smgrp ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (∃𝑙 ∈ 𝐵 (𝑙 + 𝑥) = 𝑦 ∧ ∃𝑟 ∈ 𝐵 (𝑥 + 𝑟) = 𝑦)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  ∅c0 4279  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  +_gcplusg 17345  0_gc0g 17527  Smgrpcsgrp 18823  Mndcmnd 18839  Grpcgrp 19060  inv_gcminusg 19061  -_gcsg 19062

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-0g 17529  df-mgm 18733  df-sgrp 18824  df-mnd 18840  df-grp 19063  df-minusg 19064  df-sbg 19065

This theorem is used by:  dfgrp3e  19166