Theorem imasmnd2 18666

Description: The image structure of a monoid is a monoid. (Contributed by Mario Carneiro, 24-Feb-2015.)

Hypotheses

Ref	Expression
imasmnd.u	⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))
imasmnd.v	⊢ (𝜑 → 𝑉 = (Base‘𝑅))
imasmnd.p	⊢ + = (+g‘𝑅)
imasmnd.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasmnd.e	⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
imasmnd2.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)
imasmnd2.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
imasmnd2.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
imasmnd2.3	⊢ (𝜑 → 0 ∈ 𝑉)
imasmnd2.4	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘𝑥))
imasmnd2.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑥 + 0 )) = (𝐹‘𝑥))

Assertion

Ref	Expression
imasmnd2	⊢ (𝜑 → (𝑈 ∈ Mnd ∧ (𝐹‘ 0 ) = (0g‘𝑈)))

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

Allowed substitution hints:   𝐵(𝑥,𝑦,𝑧,𝑎,𝑏)   + (𝑧,𝑎,𝑏)   𝑅(𝑥,𝑦,𝑧,𝑎,𝑏)   𝑊(𝑥,𝑦,𝑧,𝑞,𝑝,𝑎,𝑏)   0 (𝑦,𝑧,𝑎,𝑏)

Proof of Theorem imasmnd2

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

Step	Hyp	Ref	Expression
1		imasmnd.u	. . . 4 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅))
2		imasmnd.v	. . . 4 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		imasmnd.f	. . . 4 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
4		imasmnd2.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
5	1, 2, 3, 4	imasbas 17434	. . 3 ⊢ (𝜑 → 𝐵 = (Base‘𝑈))
6		eqidd 2730	. . 3 ⊢ (𝜑 → (+g‘𝑈) = (+g‘𝑈))
7		imasmnd.e	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 + 𝑏)) = (𝐹‘(𝑝 + 𝑞))))
8		imasmnd.p	. . . . 5 ⊢ + = (+g‘𝑅)
9		eqid 2729	. . . . 5 ⊢ (+g‘𝑈) = (+g‘𝑈)
10		imasmnd2.1	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
11	10	3expb 1120	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
12	11	caovclg 7545	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 + 𝑞) ∈ 𝑉)
13	3, 7, 1, 2, 4, 8, 9, 12	imasaddf 17455	. . . 4 ⊢ (𝜑 → (+g‘𝑈):(𝐵 × 𝐵)⟶𝐵)
14		fovcdm 7523	. . . 4 ⊢ (((+g‘𝑈):(𝐵 × 𝐵)⟶𝐵 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢(+g‘𝑈)𝑣) ∈ 𝐵)
15	13, 14	syl3an1 1163	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵) → (𝑢(+g‘𝑈)𝑣) ∈ 𝐵)
16		forn 6743	. . . . . . . . . 10 ⊢ (𝐹:𝑉–onto→𝐵 → ran 𝐹 = 𝐵)
17	3, 16	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐹 = 𝐵)
18	17	eleq2d 2814	. . . . . . . 8 ⊢ (𝜑 → (𝑢 ∈ ran 𝐹 ↔ 𝑢 ∈ 𝐵))
19	17	eleq2d 2814	. . . . . . . 8 ⊢ (𝜑 → (𝑣 ∈ ran 𝐹 ↔ 𝑣 ∈ 𝐵))
20	17	eleq2d 2814	. . . . . . . 8 ⊢ (𝜑 → (𝑤 ∈ ran 𝐹 ↔ 𝑤 ∈ 𝐵))
21	18, 19, 20	3anbi123d 1438	. . . . . . 7 ⊢ (𝜑 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)))
22		fofn 6742	. . . . . . . . 9 ⊢ (𝐹:𝑉–onto→𝐵 → 𝐹 Fn 𝑉)
23	3, 22	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝑉)
24		fvelrnb 6887	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑉 → (𝑢 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
25		fvelrnb 6887	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑉 → (𝑣 ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣))
26		fvelrnb 6887	. . . . . . . . 9 ⊢ (𝐹 Fn 𝑉 → (𝑤 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤))
27	24, 25, 26	3anbi123d 1438	. . . . . . . 8 ⊢ (𝐹 Fn 𝑉 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
28	23, 27	syl 17	. . . . . . 7 ⊢ (𝜑 → ((𝑢 ∈ ran 𝐹 ∧ 𝑣 ∈ ran 𝐹 ∧ 𝑤 ∈ ran 𝐹) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
29	21, 28	bitr3d 281	. . . . . 6 ⊢ (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤)))
30		3reeanv 3202	. . . . . 6 ⊢ (∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) ↔ (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 ∧ ∃𝑦 ∈ 𝑉 (𝐹‘𝑦) = 𝑣 ∧ ∃𝑧 ∈ 𝑉 (𝐹‘𝑧) = 𝑤))
31	29, 30	bitr4di 289	. . . . 5 ⊢ (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) ↔ ∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤)))
32		imasmnd2.2	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝐹‘((𝑥 + 𝑦) + 𝑧)) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
33		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝜑)
34	10	3adant3r3 1185	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
35		simpr3 1197	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑧 ∈ 𝑉)
36	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 + 𝑦) ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘((𝑥 + 𝑦) + 𝑧)))
37	33, 34, 35, 36	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘((𝑥 + 𝑦) + 𝑧)))
38		simpr1 1195	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑥 ∈ 𝑉)
39	12	caovclg 7545	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑦 + 𝑧) ∈ 𝑉)
40	39	3adantr1 1170	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (𝑦 + 𝑧) ∈ 𝑉)
41	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ (𝑦 + 𝑧) ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
42	33, 38, 40, 41	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))) = (𝐹‘(𝑥 + (𝑦 + 𝑧))))
43	32, 37, 42	3eqtr4d 2774	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))))
44	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝐹‘(𝑥 + 𝑦)))
45	44	3adant3r3 1185	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝐹‘(𝑥 + 𝑦)))
46	45	oveq1d 7368	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘(𝑥 + 𝑦))(+g‘𝑈)(𝐹‘𝑧)))
47	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘(𝑦 + 𝑧)))
48	47	3adant3r1 1183	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝐹‘(𝑦 + 𝑧)))
49	48	oveq2d 7369	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘(𝑦 + 𝑧))))
50	43, 46, 49	3eqtr4d 2774	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))))
51		simp1 1136	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑥) = 𝑢)
52		simp2 1137	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑦) = 𝑣)
53	51, 52	oveq12d 7371	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) = (𝑢(+g‘𝑈)𝑣))
54		simp3 1138	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (𝐹‘𝑧) = 𝑤)
55	53, 54	oveq12d 7371	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤))
56	52, 54	oveq12d 7371	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧)) = (𝑣(+g‘𝑈)𝑤))
57	51, 56	oveq12d 7371	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))
58	55, 57	eqeq12d 2745	. . . . . . . . . 10 ⊢ (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))(+g‘𝑈)(𝐹‘𝑧)) = ((𝐹‘𝑥)(+g‘𝑈)((𝐹‘𝑦)(+g‘𝑈)(𝐹‘𝑧))) ↔ ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
59	50, 58	syl5ibcom 245	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
60	59	3exp2 1355	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑉 → (𝑧 ∈ 𝑉 → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))))))
61	60	imp32 418	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑧 ∈ 𝑉 → (((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))))
62	61	rexlimdv 3128	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
63	62	rexlimdvva 3186	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ 𝑉 ((𝐹‘𝑥) = 𝑢 ∧ (𝐹‘𝑦) = 𝑣 ∧ (𝐹‘𝑧) = 𝑤) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
64	31, 63	sylbid 240	. . . 4 ⊢ (𝜑 → ((𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤))))
65	64	imp 406	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢(+g‘𝑈)𝑣)(+g‘𝑈)𝑤) = (𝑢(+g‘𝑈)(𝑣(+g‘𝑈)𝑤)))
66		fof 6740	. . . . 5 ⊢ (𝐹:𝑉–onto→𝐵 → 𝐹:𝑉⟶𝐵)
67	3, 66	syl 17	. . . 4 ⊢ (𝜑 → 𝐹:𝑉⟶𝐵)
68		imasmnd2.3	. . . 4 ⊢ (𝜑 → 0 ∈ 𝑉)
69	67, 68	ffvelcdmd 7023	. . 3 ⊢ (𝜑 → (𝐹‘ 0 ) ∈ 𝐵)
70	23, 24	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑢 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
71	18, 70	bitr3d 281	. . . . 5 ⊢ (𝜑 → (𝑢 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢))
72		simpl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝜑)
73	68	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 0 ∈ 𝑉)
74		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ 𝑉)
75	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . 9 ⊢ ((𝜑 ∧ 0 ∈ 𝑉 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘( 0 + 𝑥)))
76	72, 73, 74, 75	syl3anc 1373	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘( 0 + 𝑥)))
77		imasmnd2.4	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘( 0 + 𝑥)) = (𝐹‘𝑥))
78	76, 77	eqtrd 2764	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘𝑥))
79		oveq2 7361	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = ((𝐹‘ 0 )(+g‘𝑈)𝑢))
80		id 22	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑢 → (𝐹‘𝑥) = 𝑢)
81	79, 80	eqeq12d 2745	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑢 → (((𝐹‘ 0 )(+g‘𝑈)(𝐹‘𝑥)) = (𝐹‘𝑥) ↔ ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
82	78, 81	syl5ibcom 245	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
83	82	rexlimdva 3130	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
84	71, 83	sylbid 240	. . . 4 ⊢ (𝜑 → (𝑢 ∈ 𝐵 → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢))
85	84	imp 406	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐵) → ((𝐹‘ 0 )(+g‘𝑈)𝑢) = 𝑢)
86	3, 7, 1, 2, 4, 8, 9	imasaddval 17454	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 0 ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘ 0 )) = (𝐹‘(𝑥 + 0 )))
87	73, 86	mpd3an3 1464	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘ 0 )) = (𝐹‘(𝑥 + 0 )))
88		imasmnd2.5	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝐹‘(𝑥 + 0 )) = (𝐹‘𝑥))
89	87, 88	eqtrd 2764	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘ 0 )) = (𝐹‘𝑥))
90		oveq1 7360	. . . . . . . 8 ⊢ ((𝐹‘𝑥) = 𝑢 → ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘ 0 )) = (𝑢(+g‘𝑈)(𝐹‘ 0 )))
91	90, 80	eqeq12d 2745	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑢 → (((𝐹‘𝑥)(+g‘𝑈)(𝐹‘ 0 )) = (𝐹‘𝑥) ↔ (𝑢(+g‘𝑈)(𝐹‘ 0 )) = 𝑢))
92	89, 91	syl5ibcom 245	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝐹‘𝑥) = 𝑢 → (𝑢(+g‘𝑈)(𝐹‘ 0 )) = 𝑢))
93	92	rexlimdva 3130	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝑉 (𝐹‘𝑥) = 𝑢 → (𝑢(+g‘𝑈)(𝐹‘ 0 )) = 𝑢))
94	71, 93	sylbid 240	. . . 4 ⊢ (𝜑 → (𝑢 ∈ 𝐵 → (𝑢(+g‘𝑈)(𝐹‘ 0 )) = 𝑢))
95	94	imp 406	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐵) → (𝑢(+g‘𝑈)(𝐹‘ 0 )) = 𝑢)
96	5, 6, 15, 65, 69, 85, 95	ismndd 18648	. 2 ⊢ (𝜑 → 𝑈 ∈ Mnd)
97	5, 6, 69, 85, 95	grpidd 18563	. 2 ⊢ (𝜑 → (𝐹‘ 0 ) = (0g‘𝑈))
98	96, 97	jca 511	1 ⊢ (𝜑 → (𝑈 ∈ Mnd ∧ (𝐹‘ 0 ) = (0g‘𝑈)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∃wrex 3053   × cxp 5621  ran crn 5624   Fn wfn 6481  ⟶wf 6482  –onto→wfo 6484  ‘cfv 6486  (class class class)co 7353  Basecbs 17138  +_gcplusg 17179  0_gc0g 17361   “_s cimas 17426  Mndcmnd 18626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-er 8632  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-sup 9351  df-inf 9352  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11367  df-neg 11368  df-nn 12147  df-2 12209  df-3 12210  df-4 12211  df-5 12212  df-6 12213  df-7 12214  df-8 12215  df-9 12216  df-n0 12403  df-z 12490  df-dec 12610  df-uz 12754  df-fz 13429  df-struct 17076  df-slot 17111  df-ndx 17123  df-base 17139  df-plusg 17192  df-mulr 17193  df-sca 17195  df-vsca 17196  df-ip 17197  df-tset 17198  df-ple 17199  df-ds 17201  df-0g 17363  df-imas 17430  df-mgm 18532  df-sgrp 18611  df-mnd 18627

This theorem is referenced by:  imasmnd  18667