Theorem imasabl 14224

Description: The image structure of an abelian group is an abelian group (imasgrp 13967 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 14177	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
8		imasabl.z	. . . 4 ⊢ 0 = (0g‘𝑅)
9	1, 2, 3, 4, 5, 7, 8	imasgrp 13967	. . 3 ⊢ (𝜑 → (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
10	1, 2, 4, 6	imasbas 13681	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (Base‘𝑈))
11	10	eqcomd 2244	. . . . . . . . . 10 ⊢ (𝜑 → (Base‘𝑈) = 𝐵)
12	11	eleq2d 2308	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ (Base‘𝑈) ↔ 𝑥 ∈ 𝐵))
13	11	eleq2d 2308	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝑈) ↔ 𝑦 ∈ 𝐵))
14	12, 13	anbi12d 477	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
15	14	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) → ((𝑥 ∈ (Base‘𝑈) ∧ 𝑦 ∈ (Base‘𝑈)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
16		foelcdmi 5755	. . . . . . . . . . . 12 ⊢ ((𝐹:𝑉–onto→𝐵 ∧ 𝑥 ∈ 𝐵) → ∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥)
17	16	ex 115	. . . . . . . . . . 11 ⊢ (𝐹:𝑉–onto→𝐵 → (𝑥 ∈ 𝐵 → ∃𝑎 ∈ 𝑉 (𝐹‘𝑎) = 𝑥))
18		foelcdmi 5755	. . . . . . . . . . . 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 496	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → 𝑅 ∈ Abel)
24	2	eleq2d 2308	. . . . . . . . . . . . . . . . . . . . . 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 2308	. . . . . . . . . . . . . . . . . . . . . 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 2238	. . . . . . . . . . . . . . . . . . 19 ⊢ (Base‘𝑅) = (Base‘𝑅)
35		eqid 2238	. . . . . . . . . . . . . . . . . . 19 ⊢ (+g‘𝑅) = (+g‘𝑅)
36	34, 35	ablcom 14190	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑅 ∈ Abel ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) → (𝑎(+g‘𝑅)𝑏) = (𝑏(+g‘𝑅)𝑎))
37	23, 28, 33, 36	syl3anc 1278	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → (𝑎(+g‘𝑅)𝑏) = (𝑏(+g‘𝑅)𝑎))
38	37	fveq2d 5699	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
39		simplll 539	. . . . . . . . . . . . . . . . 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 2244	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → (+g‘𝑅) = + )
44	43	oveqd 6102	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑎(+g‘𝑅)𝑏) = (𝑎 + 𝑏))
45	44	fveq2d 5699	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑎 + 𝑏)))
46	43	oveqd 6102	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → (𝑝(+g‘𝑅)𝑞) = (𝑝 + 𝑞))
47	46	fveq2d 5699	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝐹‘(𝑝(+g‘𝑅)𝑞)) = (𝐹‘(𝑝 + 𝑞)))
48	45, 47	eqeq12d 2253	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → ((𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞)) ↔ (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
49	48	3ad2ant1 1049	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞)) ↔ (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
50	5, 49	sylibrd 169	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎(+g‘𝑅)𝑏)) = (𝐹‘(𝑝(+g‘𝑅)𝑞))))
51		eqid 2238	. . . . . . . . . . . . . . . . . 18 ⊢ (+g‘𝑈) = (+g‘𝑈)
52	4, 50, 1, 2, 6, 35, 51	imasaddval 13692	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝐹‘(𝑎(+g‘𝑅)𝑏)))
53	39, 41, 42, 52	syl3anc 1278	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝐹‘(𝑎(+g‘𝑅)𝑏)))
54	4, 50, 1, 2, 6, 35, 51	imasaddval 13692	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑏 ∈ 𝑉 ∧ 𝑎 ∈ 𝑉) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
55	39, 42, 41, 54	syl3anc 1278	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝐹‘(𝑏(+g‘𝑅)𝑎)))
56	38, 53, 55	3eqtr4d 2281	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)))
57	56	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) ∧ 𝑏 ∈ 𝑉) ∧ ((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥)) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)))
58		oveq12 6094	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑎) = 𝑥 ∧ (𝐹‘𝑏) = 𝑦) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝑥(+g‘𝑈)𝑦))
59	58	ancoms 268	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥) → ((𝐹‘𝑎)(+g‘𝑈)(𝐹‘𝑏)) = (𝑥(+g‘𝑈)𝑦))
60		oveq12 6094	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑏) = 𝑦 ∧ (𝐹‘𝑎) = 𝑥) → ((𝐹‘𝑏)(+g‘𝑈)(𝐹‘𝑎)) = (𝑦(+g‘𝑈)𝑥))
61	59, 60	eqeq12d 2253	. . . . . . . . . . . . . . 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 2668	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → (∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦 → ((𝐹‘𝑎) = 𝑥 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
66	65	com23 78	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))) ∧ 𝑎 ∈ 𝑉) → ((𝐹‘𝑎) = 𝑥 → (∃𝑏 ∈ 𝑉 (𝐹‘𝑏) = 𝑦 → (𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥))))
67	66	rexlimdva 2668	. . . . . . . . 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 2632	. . . 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 425	. 2 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥) ∧ (𝑈 ∈ Grp ∧ (𝐹‘ 0 ) = (0g‘𝑈))))
76		eqid 2238	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
77	76, 51	isabl2 14181	. . . 4 ⊢ (𝑈 ∈ Abel ↔ (𝑈 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)))
78	77	anbi1i 462	. . 3 ⊢ ((𝑈 ∈ Abel ∧ (𝐹‘ 0 ) = (0g‘𝑈)) ↔ ((𝑈 ∈ Grp ∧ ∀𝑥 ∈ (Base‘𝑈)∀𝑦 ∈ (Base‘𝑈)(𝑥(+g‘𝑈)𝑦) = (𝑦(+g‘𝑈)𝑥)) ∧ (𝐹‘ 0 ) = (0g‘𝑈)))
79		an21 475	. . 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‘𝑈)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  –onto→wfo 5375  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +_gcplusg 13484  0_gc0g 13663   “_s cimas 13675  Grpcgrp 13858  Abelcabl 14172

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-mulr 13498  df-0g 13665  df-iimas 13677  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-cmn 14173  df-abl 14174

This theorem is used by:  imasrng  14339