Theorem islmhm 20488

Description: Property of being a homomorphism of left modules. (Contributed by Stefan O'Rear, 1-Jan-2015.) (Proof shortened by Mario Carneiro, 30-Apr-2015.)

Hypotheses

Ref	Expression
islmhm.k	⊢ 𝐾 = (Scalar‘𝑆)
islmhm.l	⊢ 𝐿 = (Scalar‘𝑇)
islmhm.b	⊢ 𝐵 = (Base‘𝐾)
islmhm.e	⊢ 𝐸 = (Base‘𝑆)
islmhm.m	⊢ · = ( ·𝑠 ‘𝑆)
islmhm.n	⊢ × = ( ·𝑠 ‘𝑇)

Assertion

Ref	Expression
islmhm	⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))

Distinct variable groups:   𝑥,𝐵   𝑦,𝐸   𝑥,𝑦,𝑆   𝑥,𝐹,𝑦   𝑥,𝑇,𝑦

Allowed substitution hints:   𝐵(𝑦)   · (𝑥,𝑦)   × (𝑥,𝑦)   𝐸(𝑥)   𝐾(𝑥,𝑦)   𝐿(𝑥,𝑦)

Proof of Theorem islmhm

Dummy variables 𝑓 𝑠 𝑡 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-lmhm 20483	. . 3 ⊢ LMHom = (𝑠 ∈ LMod, 𝑡 ∈ LMod ↦ {𝑓 ∈ (𝑠 GrpHom 𝑡) ∣ [(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)))})
2	1	elmpocl 7595	. 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ LMod ∧ 𝑇 ∈ LMod))
3		oveq12 7366	. . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (𝑠 GrpHom 𝑡) = (𝑆 GrpHom 𝑇))
4		fvexd 6857	. . . . . . 7 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → (Scalar‘𝑠) ∈ V)
5		simplr 767	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑡 = 𝑇)
6	5	fveq2d 6846	. . . . . . . . . 10 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑡) = (Scalar‘𝑇))
7		islmhm.l	. . . . . . . . . 10 ⊢ 𝐿 = (Scalar‘𝑇)
8	6, 7	eqtr4di 2794	. . . . . . . . 9 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑡) = 𝐿)
9		simpr 485	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = (Scalar‘𝑠))
10		simpll 765	. . . . . . . . . . . 12 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑠 = 𝑆)
11	10	fveq2d 6846	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑠) = (Scalar‘𝑆))
12	9, 11	eqtrd 2776	. . . . . . . . . 10 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = (Scalar‘𝑆))
13		islmhm.k	. . . . . . . . . 10 ⊢ 𝐾 = (Scalar‘𝑆)
14	12, 13	eqtr4di 2794	. . . . . . . . 9 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = 𝐾)
15	8, 14	eqeq12d 2752	. . . . . . . 8 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ((Scalar‘𝑡) = 𝑤 ↔ 𝐿 = 𝐾))
16	14	fveq2d 6846	. . . . . . . . . 10 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑤) = (Base‘𝐾))
17		islmhm.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐾)
18	16, 17	eqtr4di 2794	. . . . . . . . 9 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑤) = 𝐵)
19	10	fveq2d 6846	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑠) = (Base‘𝑆))
20		islmhm.e	. . . . . . . . . . 11 ⊢ 𝐸 = (Base‘𝑆)
21	19, 20	eqtr4di 2794	. . . . . . . . . 10 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑠) = 𝐸)
22	10	fveq2d 6846	. . . . . . . . . . . . . 14 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠 ‘𝑠) = ( ·𝑠 ‘𝑆))
23		islmhm.m	. . . . . . . . . . . . . 14 ⊢ · = ( ·𝑠 ‘𝑆)
24	22, 23	eqtr4di 2794	. . . . . . . . . . . . 13 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠 ‘𝑠) = · )
25	24	oveqd 7374	. . . . . . . . . . . 12 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑥( ·𝑠 ‘𝑠)𝑦) = (𝑥 · 𝑦))
26	25	fveq2d 6846	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑓‘(𝑥 · 𝑦)))
27	5	fveq2d 6846	. . . . . . . . . . . . 13 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠 ‘𝑡) = ( ·𝑠 ‘𝑇))
28		islmhm.n	. . . . . . . . . . . . 13 ⊢ × = ( ·𝑠 ‘𝑇)
29	27, 28	eqtr4di 2794	. . . . . . . . . . . 12 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠 ‘𝑡) = × )
30	29	oveqd 7374	. . . . . . . . . . 11 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)) = (𝑥 × (𝑓‘𝑦)))
31	26, 30	eqeq12d 2752	. . . . . . . . . 10 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ((𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)) ↔ (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦))))
32	21, 31	raleqbidv 3319	. . . . . . . . 9 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦))))
33	18, 32	raleqbidv 3319	. . . . . . . 8 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦))))
34	15, 33	anbi12d 631	. . . . . . 7 ⊢ (((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))))
35	4, 34	sbcied 3784	. . . . . 6 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → ([(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))))
36	3, 35	rabeqbidv 3424	. . . . 5 ⊢ ((𝑠 = 𝑆 ∧ 𝑡 = 𝑇) → {𝑓 ∈ (𝑠 GrpHom 𝑡) ∣ [(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠 ‘𝑠)𝑦)) = (𝑥( ·𝑠 ‘𝑡)(𝑓‘𝑦)))} = {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))})
37		ovex 7390	. . . . . 6 ⊢ (𝑆 GrpHom 𝑇) ∈ V
38	37	rabex 5289	. . . . 5 ⊢ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))} ∈ V
39	36, 1, 38	ovmpoa 7510	. . . 4 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝑆 LMHom 𝑇) = {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))})
40	39	eleq2d 2823	. . 3 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))}))
41		fveq1 6841	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑓‘(𝑥 · 𝑦)) = (𝐹‘(𝑥 · 𝑦)))
42		fveq1 6841	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
43	42	oveq2d 7373	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑥 × (𝑓‘𝑦)) = (𝑥 × (𝐹‘𝑦)))
44	41, 43	eqeq12d 2752	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)) ↔ (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
45	44	2ralbidv 3212	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
46	45	anbi2d 629	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
47	46	elrab 3645	. . . 4 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))} ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
48		3anass 1095	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
49	47, 48	bitr4i 277	. . 3 ⊢ (𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓‘𝑦)))} ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦))))
50	40, 49	bitrdi 286	. 2 ⊢ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))
51	2, 50	biadanii 820	1 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹‘𝑦)))))

Syntax hints:   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3064  {crab 3407  Vcvv 3445  [wsbc 3739  ‘cfv 6496  (class class class)co 7357  Basecbs 17083  Scalarcsca 17136   ·_𝑠 cvsca 17137   GrpHom cghm 19005  LModclmod 20322   LMHom clmhm 20480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-iota 6448  df-fun 6498  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-lmhm 20483

This theorem is referenced by:  islmhm3  20489  lmhmlem  20490  lmhmlin  20496  islmhmd  20500  reslmhm  20513  lmhmpropd  20534