Theorem islmhm2 21318

Description: A one-equation proof of linearity of a left module homomorphism, similar to df-lss 21212. (Contributed by Mario Carneiro, 7-Oct-2015.)

Hypotheses

Ref	Expression
islmhm2.b	⊢ 𝐵 = (Base‘𝑆)
islmhm2.c	⊢ 𝐶 = (Base‘𝑇)
islmhm2.k	⊢ 𝐾 = (Scalar‘𝑆)
islmhm2.l	⊢ 𝐿 = (Scalar‘𝑇)
islmhm2.e	⊢ 𝐸 = (Base‘𝐾)
islmhm2.p	⊢ + = (+g‘𝑆)
islmhm2.q	⊢ ⨣ = (+g‘𝑇)
islmhm2.m	⊢ · = ( ·𝑠 ‘𝑆)
islmhm2.n	⊢ × = ( ·𝑠 ‘𝑇)

Assertion

Ref	Expression
islmhm2	⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))))

Distinct variable groups:   𝑥,𝑦,𝑧, ⨣   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥, + ,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝑥,𝐿,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧   𝑥, · ,𝑧   𝑥, × ,𝑧

Allowed substitution hints:   · (𝑦)   × (𝑦)

Proof of Theorem islmhm2

Step	Hyp	Ref	Expression
1		islmhm2.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑆)
2		islmhm2.c	. . . . 5 ⊢ 𝐶 = (Base‘𝑇)
3	1, 2	lmhmf 21314	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:𝐵⟶𝐶)
4		islmhm2.k	. . . . 5 ⊢ 𝐾 = (Scalar‘𝑆)
5		islmhm2.l	. . . . 5 ⊢ 𝐿 = (Scalar‘𝑇)
6	4, 5	lmhmsca 21310	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐿 = 𝐾)
7		lmghm 21311	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
8	7	adantr 486	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
9		lmhmlmod1 21313	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
10	9	adantr 486	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑆 ∈ LMod)
11		simpr1 1213	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑥 ∈ 𝐸)
12		simpr2 1214	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
13		islmhm2.m	. . . . . . . . 9 ⊢ · = ( ·𝑠 ‘𝑆)
14		islmhm2.e	. . . . . . . . 9 ⊢ 𝐸 = (Base‘𝐾)
15	1, 4, 13, 14	lmodvscl 21158	. . . . . . . 8 ⊢ ((𝑆 ∈ LMod ∧ 𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵) → (𝑥 · 𝑦) ∈ 𝐵)
16	10, 11, 12, 15	syl3anc 1398	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝑥 · 𝑦) ∈ 𝐵)
17		simpr3 1215	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑧 ∈ 𝐵)
18		islmhm2.p	. . . . . . . 8 ⊢ + = (+g‘𝑆)
19		islmhm2.q	. . . . . . . 8 ⊢ ⨣ = (+g‘𝑇)
20	1, 18, 19	ghmlin 19440	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝑥 · 𝑦) ∈ 𝐵 ∧ 𝑧 ∈ 𝐵) → (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝐹‘(𝑥 · 𝑦)) ⨣ (𝐹‘𝑧)))
21	8, 16, 17, 20	syl3anc 1398	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝐹‘(𝑥 · 𝑦)) ⨣ (𝐹‘𝑧)))
22		islmhm2.n	. . . . . . . . 9 ⊢ × = ( ·𝑠 ‘𝑇)
23	4, 14, 1, 13, 22	lmhmlin 21315	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))
24	23	3adant3r3 1203	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))
25	24	oveq1d 7435	. . . . . 6 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝐹‘(𝑥 · 𝑦)) ⨣ (𝐹‘𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))
26	21, 25	eqtrd 2795	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))
27	26	ralrimivvva 3208	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))
28	3, 6, 27	3jca 1146	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
29	28	adantl 487	. 2 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ 𝐹 ∈ (𝑆 LMHom 𝑇)) → (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
30		lmodgrp 21147	. . . . . 6 ⊢ (𝑆 ∈ LMod → 𝑆 ∈ Grp)
31		lmodgrp 21147	. . . . . 6 ⊢ (𝑇 ∈ LMod → 𝑇 ∈ Grp)
32	30, 31	anim12i 625	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝑆 ∈ Grp ∧ 𝑇 ∈ Grp))
33	32	adantr 486	. . . 4 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → (𝑆 ∈ Grp ∧ 𝑇 ∈ Grp))
34		simpr1 1213	. . . . 5 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → 𝐹:𝐵⟶𝐶)
35	4	lmodring 21148	. . . . . . . . . 10 ⊢ (𝑆 ∈ LMod → 𝐾 ∈ Ring)
36	35	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) → 𝐾 ∈ Ring)
37		eqid 2760	. . . . . . . . . 10 ⊢ (1r‘𝐾) = (1r‘𝐾)
38	14, 37	ringidcl 20499	. . . . . . . . 9 ⊢ (𝐾 ∈ Ring → (1r‘𝐾) ∈ 𝐸)
39		oveq1 7427	. . . . . . . . . . . . 13 ⊢ (𝑥 = (1r‘𝐾) → (𝑥 · 𝑦) = ((1r‘𝐾) · 𝑦))
40	39	fvoveq1d 7442	. . . . . . . . . . . 12 ⊢ (𝑥 = (1r‘𝐾) → (𝐹‘((𝑥 · 𝑦) + 𝑧)) = (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)))
41		oveq1 7427	. . . . . . . . . . . . 13 ⊢ (𝑥 = (1r‘𝐾) → (𝑥 × (𝐹‘𝑦)) = ((1r‘𝐾) × (𝐹‘𝑦)))
42	41	oveq1d 7435	. . . . . . . . . . . 12 ⊢ (𝑥 = (1r‘𝐾) → ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))
43	40, 42	eqeq12d 2776	. . . . . . . . . . 11 ⊢ (𝑥 = (1r‘𝐾) → ((𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) ↔ (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
44	43	2ralbidv 3226	. . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝐾) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
45	44	rspcv 3572	. . . . . . . . 9 ⊢ ((1r‘𝐾) ∈ 𝐸 → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
46	36, 38, 45	3syl 19	. . . . . . . 8 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧))))
47		simplll 787	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑆 ∈ LMod)
48		simprl 783	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
49	1, 4, 13, 37	lmodvs1 21170	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ LMod ∧ 𝑦 ∈ 𝐵) → ((1r‘𝐾) · 𝑦) = 𝑦)
50	47, 48, 49	syl2anc 596	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((1r‘𝐾) · 𝑦) = 𝑦)
51	50	fvoveq1d 7442	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (𝐹‘(𝑦 + 𝑧)))
52		simplrr 790	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐿 = 𝐾)
53	52	fveq2d 6889	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (1r‘𝐿) = (1r‘𝐾))
54	53	oveq1d 7435	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((1r‘𝐿) × (𝐹‘𝑦)) = ((1r‘𝐾) × (𝐹‘𝑦)))
55		simpllr 788	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝑇 ∈ LMod)
56		simplrl 789	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → 𝐹:𝐵⟶𝐶)
57	56, 48	ffvelcdmd 7085	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (𝐹‘𝑦) ∈ 𝐶)
58		eqid 2760	. . . . . . . . . . . . . 14 ⊢ (1r‘𝐿) = (1r‘𝐿)
59	2, 5, 22, 58	lmodvs1 21170	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ LMod ∧ (𝐹‘𝑦) ∈ 𝐶) → ((1r‘𝐿) × (𝐹‘𝑦)) = (𝐹‘𝑦))
60	55, 57, 59	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((1r‘𝐿) × (𝐹‘𝑦)) = (𝐹‘𝑦))
61	54, 60	eqtr3d 2797	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((1r‘𝐾) × (𝐹‘𝑦)) = (𝐹‘𝑦))
62	61	oveq1d 7435	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧)))
63	51, 62	eqeq12d 2776	. . . . . . . . 9 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) ↔ (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧))))
64	63	2ralbidva 3224	. . . . . . . 8 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) → (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(((1r‘𝐾) · 𝑦) + 𝑧)) = (((1r‘𝐾) × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) ↔ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧))))
65	46, 64	sylibd 242	. . . . . . 7 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾)) → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧))))
66	65	exp32 426	. . . . . 6 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹:𝐵⟶𝐶 → (𝐿 = 𝐾 → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧))))))
67	66	3imp2 1368	. . . . 5 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧)))
68	34, 67	jca 521	. . . 4 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → (𝐹:𝐵⟶𝐶 ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧))))
69	1, 2, 18, 19	isghm 19435	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) ∧ (𝐹:𝐵⟶𝐶 ∧ ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘(𝑦 + 𝑧)) = ((𝐹‘𝑦) ⨣ (𝐹‘𝑧)))))
70	33, 68, 69	sylanbrc 595	. . 3 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
71		simpr2 1214	. . 3 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → 𝐿 = 𝐾)
72		eqid 2760	. . . . . 6 ⊢ (0g‘𝑆) = (0g‘𝑆)
73		eqid 2760	. . . . . 6 ⊢ (0g‘𝑇) = (0g‘𝑇)
74	72, 73	ghmid 19441	. . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
75	70, 74	syl 18	. . . 4 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
76	30	ad3antrrr 743	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑆 ∈ Grp)
77	1, 72	grpidcl 19181	. . . . . . . . . 10 ⊢ (𝑆 ∈ Grp → (0g‘𝑆) ∈ 𝐵)
78		oveq2 7428	. . . . . . . . . . . . 13 ⊢ (𝑧 = (0g‘𝑆) → ((𝑥 · 𝑦) + 𝑧) = ((𝑥 · 𝑦) + (0g‘𝑆)))
79	78	fveq2d 6889	. . . . . . . . . . . 12 ⊢ (𝑧 = (0g‘𝑆) → (𝐹‘((𝑥 · 𝑦) + 𝑧)) = (𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))))
80		fveq2 6885	. . . . . . . . . . . . 13 ⊢ (𝑧 = (0g‘𝑆) → (𝐹‘𝑧) = (𝐹‘(0g‘𝑆)))
81	80	oveq2d 7436	. . . . . . . . . . . 12 ⊢ (𝑧 = (0g‘𝑆) → ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆))))
82	79, 81	eqeq12d 2776	. . . . . . . . . . 11 ⊢ (𝑧 = (0g‘𝑆) → ((𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) ↔ (𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆)))))
83	82	rspcv 3572	. . . . . . . . . 10 ⊢ ((0g‘𝑆) ∈ 𝐵 → (∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → (𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆)))))
84	76, 77, 83	3syl 19	. . . . . . . . 9 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → (𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆)))))
85		simplll 787	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑆 ∈ LMod)
86		simprl 783	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐸)
87		simprr 785	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
88	85, 86, 87, 15	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (𝑥 · 𝑦) ∈ 𝐵)
89	1, 18, 72	grprid 19184	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Grp ∧ (𝑥 · 𝑦) ∈ 𝐵) → ((𝑥 · 𝑦) + (0g‘𝑆)) = (𝑥 · 𝑦))
90	76, 88, 89	syl2anc 596	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 · 𝑦) + (0g‘𝑆)) = (𝑥 · 𝑦))
91	90	fveq2d 6889	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))) = (𝐹‘(𝑥 · 𝑦)))
92		simplr3 1236	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
93	92	oveq2d 7436	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆))) = ((𝑥 × (𝐹‘𝑦)) ⨣ (0g‘𝑇)))
94		simpllr 788	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑇 ∈ LMod)
95	94, 31	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑇 ∈ Grp)
96		simplr2 1235	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝐿 = 𝐾)
97	96	fveq2d 6889	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (Base‘𝐿) = (Base‘𝐾))
98	97, 14	eqtr4di 2813	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (Base‘𝐿) = 𝐸)
99	86, 98	eleqtrrd 2863	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ (Base‘𝐿))
100		simplr1 1234	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → 𝐹:𝐵⟶𝐶)
101	100, 87	ffvelcdmd 7085	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (𝐹‘𝑦) ∈ 𝐶)
102		eqid 2760	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐿) = (Base‘𝐿)
103	2, 5, 22, 102	lmodvscl 21158	. . . . . . . . . . . . 13 ⊢ ((𝑇 ∈ LMod ∧ 𝑥 ∈ (Base‘𝐿) ∧ (𝐹‘𝑦) ∈ 𝐶) → (𝑥 × (𝐹‘𝑦)) ∈ 𝐶)
104	94, 99, 101, 103	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (𝑥 × (𝐹‘𝑦)) ∈ 𝐶)
105	2, 19, 73	grprid 19184	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ Grp ∧ (𝑥 × (𝐹‘𝑦)) ∈ 𝐶) → ((𝑥 × (𝐹‘𝑦)) ⨣ (0g‘𝑇)) = (𝑥 × (𝐹‘𝑦)))
106	95, 104, 105	syl2anc 596	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 × (𝐹‘𝑦)) ⨣ (0g‘𝑇)) = (𝑥 × (𝐹‘𝑦)))
107	93, 106	eqtrd 2795	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆))) = (𝑥 × (𝐹‘𝑦)))
108	91, 107	eqeq12d 2776	. . . . . . . . 9 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → ((𝐹‘((𝑥 · 𝑦) + (0g‘𝑆))) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘(0g‘𝑆))) ↔ (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
109	84, 108	sylibd 242	. . . . . . . 8 ⊢ ((((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) ∧ (𝑥 ∈ 𝐸 ∧ 𝑦 ∈ 𝐵)) → (∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
110	109	ralimdvva 3209	. . . . . . 7 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑇))) → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
111	110	3exp2 1373	. . . . . 6 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹:𝐵⟶𝐶 → (𝐿 = 𝐾 → ((𝐹‘(0g‘𝑆)) = (0g‘𝑇) → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))))
112	111	com45 98	. . . . 5 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹:𝐵⟶𝐶 → (𝐿 = 𝐾 → (∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)) → ((𝐹‘(0g‘𝑆)) = (0g‘𝑇) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))))
113	112	3imp2 1368	. . . 4 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → ((𝐹‘(0g‘𝑆)) = (0g‘𝑇) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
114	75, 113	mpd 16	. . 3 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))
115	4, 5, 14, 1, 13, 22	islmhm3 21308	. . . 4 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
116	115	adantr 486	. . 3 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
117	70, 71, 114, 116	mpbir3and 1361	. 2 ⊢ (((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))) → 𝐹 ∈ (𝑆 LMHom 𝑇))
118	29, 117	impbida 813	1 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹:𝐵⟶𝐶 ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐸 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 (𝐹‘((𝑥 · 𝑦) + 𝑧)) = ((𝑥 × (𝐹‘𝑦)) ⨣ (𝐹‘𝑧)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  +_gcplusg 17433  Scalarcsca 17436   ·_𝑠 cvsca 17437  0_gc0g 17615  Grpcgrp 19149   GrpHom cghm 19432  1_rcur 20412  Ringcrg 20464  LModclmod 21140   LMHom clmhm 21299

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-er 8720  df-map 8852  df-en 8977  df-dom 8978  df-sdom 8979  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-nn 12339  df-2 12408  df-sets 17347  df-slot 17365  df-ndx 17377  df-base 17393  df-plusg 17446  df-0g 17617  df-mgm 18821  df-sgrp 18913  df-mnd 18929  df-grp 19152  df-ghm 19433  df-mgp 20366  df-ur 20413  df-ring 20466  df-lmod 21142  df-lmhm 21302

This theorem is used by:  isphld  21965