Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  islmhm Structured version   Visualization version   GIF version

Theorem islmhm 19735
 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.
StepHypRef Expression
1 df-lmhm 19730 . . 3 LMHom = (𝑠 ∈ LMod, 𝑡 ∈ LMod ↦ {𝑓 ∈ (𝑠 GrpHom 𝑡) ∣ [(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦)))})
21elmpocl 7381 . 2 (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ LMod ∧ 𝑇 ∈ LMod))
3 oveq12 7159 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → (𝑠 GrpHom 𝑡) = (𝑆 GrpHom 𝑇))
4 fvexd 6684 . . . . . . 7 ((𝑠 = 𝑆𝑡 = 𝑇) → (Scalar‘𝑠) ∈ V)
5 simplr 765 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑡 = 𝑇)
65fveq2d 6673 . . . . . . . . . 10 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑡) = (Scalar‘𝑇))
7 islmhm.l . . . . . . . . . 10 𝐿 = (Scalar‘𝑇)
86, 7syl6eqr 2879 . . . . . . . . 9 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑡) = 𝐿)
9 simpr 485 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = (Scalar‘𝑠))
10 simpll 763 . . . . . . . . . . . 12 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑠 = 𝑆)
1110fveq2d 6673 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Scalar‘𝑠) = (Scalar‘𝑆))
129, 11eqtrd 2861 . . . . . . . . . 10 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = (Scalar‘𝑆))
13 islmhm.k . . . . . . . . . 10 𝐾 = (Scalar‘𝑆)
1412, 13syl6eqr 2879 . . . . . . . . 9 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → 𝑤 = 𝐾)
158, 14eqeq12d 2842 . . . . . . . 8 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ((Scalar‘𝑡) = 𝑤𝐿 = 𝐾))
1614fveq2d 6673 . . . . . . . . . 10 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑤) = (Base‘𝐾))
17 islmhm.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
1816, 17syl6eqr 2879 . . . . . . . . 9 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑤) = 𝐵)
1910fveq2d 6673 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑠) = (Base‘𝑆))
20 islmhm.e . . . . . . . . . . 11 𝐸 = (Base‘𝑆)
2119, 20syl6eqr 2879 . . . . . . . . . 10 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (Base‘𝑠) = 𝐸)
2210fveq2d 6673 . . . . . . . . . . . . . 14 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠𝑠) = ( ·𝑠𝑆))
23 islmhm.m . . . . . . . . . . . . . 14 · = ( ·𝑠𝑆)
2422, 23syl6eqr 2879 . . . . . . . . . . . . 13 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠𝑠) = · )
2524oveqd 7167 . . . . . . . . . . . 12 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑥( ·𝑠𝑠)𝑦) = (𝑥 · 𝑦))
2625fveq2d 6673 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑓‘(𝑥 · 𝑦)))
275fveq2d 6673 . . . . . . . . . . . . 13 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠𝑡) = ( ·𝑠𝑇))
28 islmhm.n . . . . . . . . . . . . 13 × = ( ·𝑠𝑇)
2927, 28syl6eqr 2879 . . . . . . . . . . . 12 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ( ·𝑠𝑡) = × )
3029oveqd 7167 . . . . . . . . . . 11 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (𝑥( ·𝑠𝑡)(𝑓𝑦)) = (𝑥 × (𝑓𝑦)))
3126, 30eqeq12d 2842 . . . . . . . . . 10 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → ((𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦)) ↔ (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦))))
3221, 31raleqbidv 3407 . . . . . . . . 9 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦)) ↔ ∀𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦))))
3318, 32raleqbidv 3407 . . . . . . . 8 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦))))
3415, 33anbi12d 630 . . . . . . 7 (((𝑠 = 𝑆𝑡 = 𝑇) ∧ 𝑤 = (Scalar‘𝑠)) → (((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))))
354, 34sbcied 3818 . . . . . 6 ((𝑠 = 𝑆𝑡 = 𝑇) → ([(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))))
363, 35rabeqbidv 3491 . . . . 5 ((𝑠 = 𝑆𝑡 = 𝑇) → {𝑓 ∈ (𝑠 GrpHom 𝑡) ∣ [(Scalar‘𝑠) / 𝑤]((Scalar‘𝑡) = 𝑤 ∧ ∀𝑥 ∈ (Base‘𝑤)∀𝑦 ∈ (Base‘𝑠)(𝑓‘(𝑥( ·𝑠𝑠)𝑦)) = (𝑥( ·𝑠𝑡)(𝑓𝑦)))} = {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))})
37 ovex 7183 . . . . . 6 (𝑆 GrpHom 𝑇) ∈ V
3837rabex 5232 . . . . 5 {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))} ∈ V
3936, 1, 38ovmpoa 7299 . . . 4 ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝑆 LMHom 𝑇) = {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))})
4039eleq2d 2903 . . 3 ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ 𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))}))
41 fveq1 6668 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓‘(𝑥 · 𝑦)) = (𝐹‘(𝑥 · 𝑦)))
42 fveq1 6668 . . . . . . . . 9 (𝑓 = 𝐹 → (𝑓𝑦) = (𝐹𝑦))
4342oveq2d 7166 . . . . . . . 8 (𝑓 = 𝐹 → (𝑥 × (𝑓𝑦)) = (𝑥 × (𝐹𝑦)))
4441, 43eqeq12d 2842 . . . . . . 7 (𝑓 = 𝐹 → ((𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)) ↔ (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦))))
45442ralbidv 3204 . . . . . 6 (𝑓 = 𝐹 → (∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦))))
4645anbi2d 628 . . . . 5 (𝑓 = 𝐹 → ((𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦))) ↔ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
4746elrab 3684 . . . 4 (𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))} ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
48 3anass 1089 . . . 4 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦))) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
4947, 48bitr4i 279 . . 3 (𝐹 ∈ {𝑓 ∈ (𝑆 GrpHom 𝑇) ∣ (𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝑓‘(𝑥 · 𝑦)) = (𝑥 × (𝑓𝑦)))} ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦))))
5040, 49syl6bb 288 . 2 ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) → (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
512, 50biadanii 819 1 (𝐹 ∈ (𝑆 LMHom 𝑇) ↔ ((𝑆 ∈ LMod ∧ 𝑇 ∈ LMod) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐿 = 𝐾 ∧ ∀𝑥𝐵𝑦𝐸 (𝐹‘(𝑥 · 𝑦)) = (𝑥 × (𝐹𝑦)))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 207   ∧ wa 396   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107  ∀wral 3143  {crab 3147  Vcvv 3500  [wsbc 3776  ‘cfv 6354  (class class class)co 7150  Basecbs 16478  Scalarcsca 16563   ·𝑠 cvsca 16564   GrpHom cghm 18300  LModclmod 19570   LMHom clmhm 19727 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ral 3148  df-rex 3149  df-rab 3152  df-v 3502  df-sbc 3777  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-br 5064  df-opab 5126  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-iota 6313  df-fun 6356  df-fv 6362  df-ov 7153  df-oprab 7154  df-mpo 7155  df-lmhm 19730 This theorem is referenced by:  islmhm3  19736  lmhmlem  19737  lmhmlin  19743  islmhmd  19747  reslmhm  19760  lmhmpropd  19781
 Copyright terms: Public domain W3C validator