Theorem imasabl 13406

Description: The image structure of an abelian group is an abelian group (imasgrp 13181 analog). (Contributed by AV, 22-Feb-2025.)

Hypotheses

Ref	Expression
imasabl.u	⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))
imasabl.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imasabl.p	⊢ (𝜑 → + = (+g‘𝑅))
imasabl.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasabl.e	⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
imasabl.r	⊢ (𝜑 → 𝑅 ∈ Abel)
imasabl.z	⊢ 0 = (0g‘𝑅)

Assertion

Ref	Expression
imasabl	⊢ (𝜑 → (𝑈 ∈ Abel ∧ (𝐹‘ 0 ) = (0g‘𝑈)))

Distinct variable groups:   𝐵,𝑎,𝑏,𝑝,𝑞   𝐹,𝑎,𝑏,𝑝,𝑞   𝑅,𝑝,𝑞   𝑈,𝑎,𝑏,𝑝,𝑞   𝑉,𝑎,𝑏,𝑝,𝑞   + ,𝑝,𝑞   0 ,𝑎,𝑏,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞

Allowed substitution hints:   + (𝑎,𝑏)   𝑅(𝑎,𝑏)

Proof of Theorem imasabl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasabl.u	. . . 4 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))
2		imasabl.v	. . . 4 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		imasabl.p	. . . 4 ⊢ (𝜑 → + = (+g‘𝑅))
4		imasabl.f	. . . 4 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
5		imasabl.e	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
6		imasabl.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Abel)
7	6	ablgrpd 13360	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
8		imasabl.z	. . . 4 ⊢ 0 = (0g‘𝑅)
9	1, 2, 3, 4, 5, 7, 8	imasgrp 13181	. . 3 ⊢ (𝜑 → (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
10	1, 2, 4, 6	imasbas 12890	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (Base‘𝑈))
11	10	eqcomd 2199	. . . . . . . . . 10 ⊢ (𝜑 → (Base‘𝑈) = 𝐵)
12	11	eleq2d 2263	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑈) ↔ 𝑥 ∈ 𝐵))
13	11	eleq2d 2263	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝑈) ↔ 𝑦 ∈ 𝐵))
14	12, 13	anbi12d 473	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
15	14	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
16		foelcdmi 5609	. . . . . . . . . . . 12 ⊢ ((𝐹:𝑉–onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥)
17	16	ex 115	. . . . . . . . . . 11 ⊢ (𝐹:𝑉–onto→𝐵 → (𝑥 ∈ 𝐵 → ∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥))
18		foelcdmi 5609	. . . . . . . . . . . 12 ⊢ ((𝐹:𝑉–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦)
19	18	ex 115	. . . . . . . . . . 11 ⊢ (𝐹:𝑉–onto→𝐵 → (𝑦 ∈ 𝐵 → ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦))
20	17, 19	anim12d 335	. . . . . . . . . 10 ⊢ (𝐹:𝑉–onto→𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥 ∧ ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦)))
21	4, 20	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥 ∧ ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦)))
22	21	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥 ∧ ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦)))
23	6	ad3antrrr 492	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑅 ∈ Abel)
24	2	eleq2d 2263	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑎 ∈ 𝑉 ↔ 𝑎 ∈ (Base‘𝑅)))
25	24	biimpd 144	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑎 ∈ 𝑉 → 𝑎 ∈ (Base‘𝑅)))
26	25	adantr 276	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → (𝑎 ∈ 𝑉 → 𝑎 ∈ (Base‘𝑅)))
27	26	imp 124	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → 𝑎 ∈ (Base‘𝑅))
28	27	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑎 ∈ (Base‘𝑅))
29	2	eleq2d 2263	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑏 ∈ 𝑉 ↔ 𝑏 ∈ (Base‘𝑅)))
30	29	biimpd 144	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝑏 ∈ 𝑉 → 𝑏 ∈ (Base‘𝑅)))
31	30	adantr 276	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → (𝑏 ∈ 𝑉 → 𝑏 ∈ (Base‘𝑅)))
32	31	adantr 276	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → (𝑏 ∈ 𝑉 → 𝑏 ∈ (Base‘𝑅)))
33	32	imp 124	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑏 ∈ (Base‘𝑅))
34		eqid 2193	. . . . . . . . . . . . . . . . . . 19 ⊢ (Base‘𝑅) = (Base‘𝑅)
35		eqid 2193	. . . . . . . . . . . . . . . . . . 19 ⊢ (+g‘𝑅) = (+g‘𝑅)
36	34, 35	ablcom 13373	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑅 ∈ Abel ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) → (𝑎(+g‘𝑅)𝑏) = (𝑏(+g‘𝑅)𝑎))
37	23, 28, 33, 36	syl3anc 1249	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → (𝑎(+g‘𝑅)𝑏) = (𝑏(+g‘𝑅)𝑎))
38	37	fveq2d 5558	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
39		simplll 533	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝜑)
40		simpr 110	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → 𝑎 ∈ 𝑉)
41	40	adantr 276	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑎 ∈ 𝑉)
42		simpr 110	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑏 ∈ 𝑉)
43	3	eqcomd 2199	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → (+g‘𝑅) = + )
44	43	oveqd 5935	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑎(+g‘𝑅)𝑏) = (𝑎 + 𝑏))
45	44	fveq2d 5558	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑎 + 𝑏)))
46	43	oveqd 5935	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑝(+g‘𝑅)𝑞) = (𝑝 + 𝑞))
47	46	fveq2d 5558	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝐹‘(𝑝(+g‘𝑅)𝑞)) = (𝐹‘(𝑝 + 𝑞)))
48	45, 47	eqeq12d 2208	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞)) ↔ (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
49	48	3ad2ant1 1020	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞)) ↔ (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
50	5, 49	sylibrd 169	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞))))
51		eqid 2193	. . . . . . . . . . . . . . . . . 18 ⊢ (+g‘𝑈) = (+g‘𝑈)
52	4, 50, 1, 2, 6, 35, 51	imasaddval 12901	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝐹‘(𝑎(+g‘𝑅)𝑏)))
53	39, 41, 42, 52	syl3anc 1249	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝐹‘(𝑎(+g‘𝑅)𝑏)))
54	4, 50, 1, 2, 6, 35, 51	imasaddval 12901	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝑉 ∧ 𝑎 ∈ 𝑉) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
55	39, 42, 41, 54	syl3anc 1249	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
56	38, 53, 55	3eqtr4d 2236	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)))
57	56	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) ∧ ((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥)) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)))
58		oveq12 5927	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑎) = 𝑥 ∧ (𝐹‘𝑏) = 𝑦) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝑥(+g‘𝑈)𝑦))
59	58	ancoms 268	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝑥(+g‘𝑈)𝑦))
60		oveq12 5927	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝑦(+g‘𝑈)𝑥))
61	59, 60	eqeq12d 2208	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥) → (((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) ↔ (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
62	61	adantl 277	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) ∧ ((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥)) → (((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) ↔ (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
63	57, 62	mpbid 147	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) ∧ ((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥)) → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))
64	63	exp32 365	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑏) = 𝑦 → ((𝐹‘𝑎) = 𝑥 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
65	64	rexlimdva 2611	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → (∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦 → ((𝐹‘𝑎) = 𝑥 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
66	65	com23 78	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → ((𝐹‘𝑎) = 𝑥 → (∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
67	66	rexlimdva 2611	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → (∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥 → (∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
68	67	impd 254	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥 ∧ ∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦) → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
69	22, 68	syld 45	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
70	15, 69	sylbid 150	. . . . . 6 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈)) → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
71	70	imp 124	. . . . 5 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ (𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈))) → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))
72	71	ralrimivva 2576	. . . 4 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))
73		simpr 110	. . . 4 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
74	72, 73	jca 306	. . 3 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → (∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥) ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))))
75	9, 74	mpdan 421	. 2 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥) ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))))
76		eqid 2193	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
77	76, 51	isabl2 13364	. . . 4 ⊢ (𝑈 ∈ Abel ↔ (𝑈 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
78	77	anbi1i 458	. . 3 ⊢ ((𝑈 ∈ Abel ∧ (𝐹‘ 0 ) = (0g‘𝑈)) ↔ ((𝑈 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)) ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
79		an21 471	. . 3 ⊢ (((𝑈 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)) ∧ (𝐹‘ 0 ) = (0g‘𝑈)) ↔ (∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥) ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))))
80	78, 79	bitri 184	. 2 ⊢ ((𝑈 ∈ Abel ∧ (𝐹‘ 0 ) = (0g‘𝑈)) ↔ (∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥) ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))))
81	75, 80	sylibr 134	1 ⊢ (𝜑 → (𝑈 ∈ Abel ∧ (𝐹‘ 0 ) = (0g‘𝑈)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 980   = wceq 1364   ∈ wcel 2164  ∀wral 2472  ∃wrex 2473  –onto→wfo 5252  ‘cfv 5254  (class class class)co 5918  Basecbs 12618  +_gcplusg 12695  0_gc0g 12867   “_s cimas 12882  Grpcgrp 13072  Abelcabl 13355

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 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 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-ltadd 7988

This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-tp 3626  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-inn 8983  df-2 9041  df-3 9042  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-mulr 12709  df-0g 12869  df-iimas 12885  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075  df-minusg 13076  df-cmn 13356  df-abl 13357

This theorem is referenced by:  imasrng  13452