Theorem sgrppropd 12873

Description: If two structures are sets, have the same base set, and the values of their group (addition) operations are equal for all pairs of elements of the base set, one is a semigroup iff the other one is. (Contributed by AV, 15-Feb-2025.)

Hypotheses

Ref	Expression
sgrppropd.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
sgrppropd.l	⊢ (𝜑 → 𝐿 ∈ 𝑊)
sgrppropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
sgrppropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
sgrppropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))

Assertion

Ref	Expression
sgrppropd	⊢ (𝜑 → (𝐾 ∈ Smgrp ↔ 𝐿 ∈ Smgrp))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝐿,𝑦

Allowed substitution hints:   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem sgrppropd

Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐾 ∈ Smgrp)
2		simprl 529	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
3		sgrppropd.1	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
4	3	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐾))
5	2, 4	eleqtrd 2268	. . . . . 6 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ (Base‘𝐾))
6		simprr 531	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
7	6, 4	eleqtrd 2268	. . . . . 6 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ (Base‘𝐾))
8		eqid 2189	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
9		eqid 2189	. . . . . . 7 ⊢ (+g‘𝐾) = (+g‘𝐾)
10	8, 9	sgrpcl 12869	. . . . . 6 ⊢ ((𝐾 ∈ Smgrp ∧ 𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → (𝑥(+g‘𝐾)𝑦) ∈ (Base‘𝐾))
11	1, 5, 7, 10	syl3anc 1249	. . . . 5 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) ∈ (Base‘𝐾))
12	11, 4	eleqtrrd 2269	. . . 4 ⊢ (((𝜑 ∧ 𝐾 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) ∈ 𝐵)
13	12	ralrimivva 2572	. . 3 ⊢ ((𝜑 ∧ 𝐾 ∈ Smgrp) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵)
14	13	ex 115	. 2 ⊢ (𝜑 → (𝐾 ∈ Smgrp → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵))
15		simplr 528	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐿 ∈ Smgrp)
16		simprl 529	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
17		sgrppropd.2	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
18	17	ad2antrr 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐿))
19	16, 18	eleqtrd 2268	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ (Base‘𝐿))
20		simprr 531	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
21	20, 18	eleqtrd 2268	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ (Base‘𝐿))
22		eqid 2189	. . . . . . 7 ⊢ (Base‘𝐿) = (Base‘𝐿)
23		eqid 2189	. . . . . . 7 ⊢ (+g‘𝐿) = (+g‘𝐿)
24	22, 23	sgrpcl 12869	. . . . . 6 ⊢ ((𝐿 ∈ Smgrp ∧ 𝑥 ∈ (Base‘𝐿) ∧ 𝑦 ∈ (Base‘𝐿)) → (𝑥(+g‘𝐿)𝑦) ∈ (Base‘𝐿))
25	15, 19, 21, 24	syl3anc 1249	. . . . 5 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐿)𝑦) ∈ (Base‘𝐿))
26		sgrppropd.3	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
27	26	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
28	25, 27, 18	3eltr4d 2273	. . . 4 ⊢ (((𝜑 ∧ 𝐿 ∈ Smgrp) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) ∈ 𝐵)
29	28	ralrimivva 2572	. . 3 ⊢ ((𝜑 ∧ 𝐿 ∈ Smgrp) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵)
30	29	ex 115	. 2 ⊢ (𝜑 → (𝐿 ∈ Smgrp → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵))
31		sgrppropd.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
32	8, 9	issgrpv 12864	. . . . . 6 ⊢ (𝐾 ∈ 𝑉 → (𝐾 ∈ Smgrp ↔ ∀𝑢 ∈ (Base‘𝐾)∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
33	31, 32	syl 14	. . . . 5 ⊢ (𝜑 → (𝐾 ∈ Smgrp ↔ ∀𝑢 ∈ (Base‘𝐾)∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
34	33	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (𝐾 ∈ Smgrp ↔ ∀𝑢 ∈ (Base‘𝐾)∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
35	26	oveqrspc2v 5922	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢(+g‘𝐾)𝑣) = (𝑢(+g‘𝐿)𝑣))
36	35	adantlr 477	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢(+g‘𝐾)𝑣) = (𝑢(+g‘𝐿)𝑣))
37	36	eleq1d 2258	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ↔ (𝑢(+g‘𝐿)𝑣) ∈ 𝐵))
38		simplll 533	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → 𝜑)
39		simplrl 535	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → 𝑢 ∈ 𝐵)
40		simplrr 536	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → 𝑣 ∈ 𝐵)
41		simpllr 534	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵)
42		ovrspc2v 5921	. . . . . . . . . . . 12 ⊢ (((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (𝑢(+g‘𝐾)𝑣) ∈ 𝐵)
43	39, 40, 41, 42	syl21anc 1248	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑢(+g‘𝐾)𝑣) ∈ 𝐵)
44		simpr 110	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → 𝑤 ∈ 𝐵)
45	26	oveqrspc2v 5922	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = ((𝑢(+g‘𝐾)𝑣)(+g‘𝐿)𝑤))
46	38, 43, 44, 45	syl12anc 1247	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = ((𝑢(+g‘𝐾)𝑣)(+g‘𝐿)𝑤))
47	38, 39, 40, 35	syl12anc 1247	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑢(+g‘𝐾)𝑣) = (𝑢(+g‘𝐿)𝑣))
48	47	oveq1d 5910	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → ((𝑢(+g‘𝐾)𝑣)(+g‘𝐿)𝑤) = ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤))
49	46, 48	eqtrd 2222	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤))
50		ovrspc2v 5921	. . . . . . . . . . . 12 ⊢ (((𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (𝑣(+g‘𝐾)𝑤) ∈ 𝐵)
51	40, 44, 41, 50	syl21anc 1248	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑣(+g‘𝐾)𝑤) ∈ 𝐵)
52	26	oveqrspc2v 5922	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ (𝑣(+g‘𝐾)𝑤) ∈ 𝐵)) → (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐾)𝑤)))
53	38, 39, 51, 52	syl12anc 1247	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐾)𝑤)))
54	26	oveqrspc2v 5922	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑣(+g‘𝐾)𝑤) = (𝑣(+g‘𝐿)𝑤))
55	38, 40, 44, 54	syl12anc 1247	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑣(+g‘𝐾)𝑤) = (𝑣(+g‘𝐿)𝑤))
56	55	oveq2d 5911	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑢(+g‘𝐿)(𝑣(+g‘𝐾)𝑤)) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))
57	53, 56	eqtrd 2222	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))
58	49, 57	eqeq12d 2204	. . . . . . . 8 ⊢ ((((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) ∧ 𝑤 ∈ 𝐵) → (((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) ↔ ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))))
59	58	ralbidva 2486	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) ↔ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))))
60	37, 59	anbi12d 473	. . . . . 6 ⊢ (((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
61	60	2ralbidva 2512	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
62	3	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → 𝐵 = (Base‘𝐾))
63	62	eleq2d 2259	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ↔ (𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾)))
64	62	raleqdv 2692	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)) ↔ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))))
65	63, 64	anbi12d 473	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
66	62, 65	raleqbidv 2698	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
67	62, 66	raleqbidv 2698	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ∀𝑢 ∈ (Base‘𝐾)∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤)))))
68	17	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → 𝐵 = (Base‘𝐿))
69	68	eleq2d 2259	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → ((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ↔ (𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿)))
70	68	raleqdv 2692	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)) ↔ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))))
71	69, 70	anbi12d 473	. . . . . . 7 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))) ↔ ((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
72	68, 71	raleqbidv 2698	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))) ↔ ∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
73	68, 72	raleqbidv 2698	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝐵 ((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))) ↔ ∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
74	61, 67, 73	3bitr3d 218	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑢 ∈ (Base‘𝐾)∀𝑣 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣) ∈ (Base‘𝐾) ∧ ∀𝑤 ∈ (Base‘𝐾)((𝑢(+g‘𝐾)𝑣)(+g‘𝐾)𝑤) = (𝑢(+g‘𝐾)(𝑣(+g‘𝐾)𝑤))) ↔ ∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
75		sgrppropd.l	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ 𝑊)
76	22, 23	issgrpv 12864	. . . . . . 7 ⊢ (𝐿 ∈ 𝑊 → (𝐿 ∈ Smgrp ↔ ∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
77	75, 76	syl 14	. . . . . 6 ⊢ (𝜑 → (𝐿 ∈ Smgrp ↔ ∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤)))))
78	77	bicomd 141	. . . . 5 ⊢ (𝜑 → (∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))) ↔ 𝐿 ∈ Smgrp))
79	78	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (∀𝑢 ∈ (Base‘𝐿)∀𝑣 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣) ∈ (Base‘𝐿) ∧ ∀𝑤 ∈ (Base‘𝐿)((𝑢(+g‘𝐿)𝑣)(+g‘𝐿)𝑤) = (𝑢(+g‘𝐿)(𝑣(+g‘𝐿)𝑤))) ↔ 𝐿 ∈ Smgrp))
80	34, 74, 79	3bitrd 214	. . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵) → (𝐾 ∈ Smgrp ↔ 𝐿 ∈ Smgrp))
81	80	ex 115	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) ∈ 𝐵 → (𝐾 ∈ Smgrp ↔ 𝐿 ∈ Smgrp)))
82	14, 30, 81	pm5.21ndd 706	1 ⊢ (𝜑 → (𝐾 ∈ Smgrp ↔ 𝐿 ∈ Smgrp))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2160  ∀wral 2468  ‘cfv 5235  (class class class)co 5895  Basecbs 12511  +_gcplusg 12586  Smgrpcsgrp 12861

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-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-cnex 7931  ax-resscn 7932  ax-1re 7934  ax-addrcl 7937

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-sbc 2978  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-iota 5196  df-fun 5237  df-fn 5238  df-fv 5243  df-ov 5898  df-inn 8949  df-2 9007  df-ndx 12514  df-slot 12515  df-base 12517  df-plusg 12599  df-mgm 12829  df-sgrp 12862

This theorem is referenced by:  rngpropd  13306