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

Theorem lmhmpreima 20225
Description: The inverse image of a subspace under a homomorphism. (Contributed by Stefan O'Rear, 1-Jan-2015.)
Hypotheses
Ref Expression
lmhmima.x 𝑋 = (LSubSp‘𝑆)
lmhmima.y 𝑌 = (LSubSp‘𝑇)
Assertion
Ref Expression
lmhmpreima ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (𝐹𝑈) ∈ 𝑋)

Proof of Theorem lmhmpreima
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lmghm 20208 . . 3 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
2 lmhmlmod2 20209 . . . 4 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
3 lmhmima.y . . . . 5 𝑌 = (LSubSp‘𝑇)
43lsssubg 20134 . . . 4 ((𝑇 ∈ LMod ∧ 𝑈𝑌) → 𝑈 ∈ (SubGrp‘𝑇))
52, 4sylan 579 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → 𝑈 ∈ (SubGrp‘𝑇))
6 ghmpreima 18771 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ (SubGrp‘𝑇)) → (𝐹𝑈) ∈ (SubGrp‘𝑆))
71, 5, 6syl2an2r 681 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (𝐹𝑈) ∈ (SubGrp‘𝑆))
8 lmhmlmod1 20210 . . . . . 6 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
98ad2antrr 722 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑆 ∈ LMod)
10 simprl 767 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
11 cnvimass 5978 . . . . . . . 8 (𝐹𝑈) ⊆ dom 𝐹
12 eqid 2738 . . . . . . . . . 10 (Base‘𝑆) = (Base‘𝑆)
13 eqid 2738 . . . . . . . . . 10 (Base‘𝑇) = (Base‘𝑇)
1412, 13lmhmf 20211 . . . . . . . . 9 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1514adantr 480 . . . . . . . 8 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1611, 15fssdm 6604 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (𝐹𝑈) ⊆ (Base‘𝑆))
1716sselda 3917 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ 𝑏 ∈ (𝐹𝑈)) → 𝑏 ∈ (Base‘𝑆))
1817adantrl 712 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑏 ∈ (Base‘𝑆))
19 eqid 2738 . . . . . 6 (Scalar‘𝑆) = (Scalar‘𝑆)
20 eqid 2738 . . . . . 6 ( ·𝑠𝑆) = ( ·𝑠𝑆)
21 eqid 2738 . . . . . 6 (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
2212, 19, 20, 21lmodvscl 20055 . . . . 5 ((𝑆 ∈ LMod ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝑎( ·𝑠𝑆)𝑏) ∈ (Base‘𝑆))
239, 10, 18, 22syl3anc 1369 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝑎( ·𝑠𝑆)𝑏) ∈ (Base‘𝑆))
24 simpll 763 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝐹 ∈ (𝑆 LMHom 𝑇))
25 eqid 2738 . . . . . . 7 ( ·𝑠𝑇) = ( ·𝑠𝑇)
2619, 21, 12, 20, 25lmhmlin 20212 . . . . . 6 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (Base‘𝑆)) → (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) = (𝑎( ·𝑠𝑇)(𝐹𝑏)))
2724, 10, 18, 26syl3anc 1369 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) = (𝑎( ·𝑠𝑇)(𝐹𝑏)))
282ad2antrr 722 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑇 ∈ LMod)
29 simplr 765 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑈𝑌)
30 eqid 2738 . . . . . . . . . . . 12 (Scalar‘𝑇) = (Scalar‘𝑇)
3119, 30lmhmsca 20207 . . . . . . . . . . 11 (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
3231adantr 480 . . . . . . . . . 10 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (Scalar‘𝑇) = (Scalar‘𝑆))
3332fveq2d 6760 . . . . . . . . 9 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
3433eleq2d 2824 . . . . . . . 8 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (𝑎 ∈ (Base‘(Scalar‘𝑇)) ↔ 𝑎 ∈ (Base‘(Scalar‘𝑆))))
3534biimpar 477 . . . . . . 7 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆))) → 𝑎 ∈ (Base‘(Scalar‘𝑇)))
3635adantrr 713 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑎 ∈ (Base‘(Scalar‘𝑇)))
3715ffund 6588 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → Fun 𝐹)
38 simprr 769 . . . . . . 7 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → 𝑏 ∈ (𝐹𝑈))
39 fvimacnvi 6911 . . . . . . 7 ((Fun 𝐹𝑏 ∈ (𝐹𝑈)) → (𝐹𝑏) ∈ 𝑈)
4037, 38, 39syl2an2r 681 . . . . . 6 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝐹𝑏) ∈ 𝑈)
41 eqid 2738 . . . . . . 7 (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
4230, 25, 41, 3lssvscl 20132 . . . . . 6 (((𝑇 ∈ LMod ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ (𝐹𝑏) ∈ 𝑈)) → (𝑎( ·𝑠𝑇)(𝐹𝑏)) ∈ 𝑈)
4328, 29, 36, 40, 42syl22anc 835 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝑎( ·𝑠𝑇)(𝐹𝑏)) ∈ 𝑈)
4427, 43eqeltrd 2839 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) ∈ 𝑈)
45 ffn 6584 . . . . . 6 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 Fn (Base‘𝑆))
46 elpreima 6917 . . . . . 6 (𝐹 Fn (Base‘𝑆) → ((𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈) ↔ ((𝑎( ·𝑠𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) ∈ 𝑈)))
4715, 45, 463syl 18 . . . . 5 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → ((𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈) ↔ ((𝑎( ·𝑠𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) ∈ 𝑈)))
4847adantr 480 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → ((𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈) ↔ ((𝑎( ·𝑠𝑆)𝑏) ∈ (Base‘𝑆) ∧ (𝐹‘(𝑎( ·𝑠𝑆)𝑏)) ∈ 𝑈)))
4923, 44, 48mpbir2and 709 . . 3 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈))
5049ralrimivva 3114 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → ∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈))
518adantr 480 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → 𝑆 ∈ LMod)
52 lmhmima.x . . . 4 𝑋 = (LSubSp‘𝑆)
5319, 21, 12, 20, 52islss4 20139 . . 3 (𝑆 ∈ LMod → ((𝐹𝑈) ∈ 𝑋 ↔ ((𝐹𝑈) ∈ (SubGrp‘𝑆) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈))))
5451, 53syl 17 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → ((𝐹𝑈) ∈ 𝑋 ↔ ((𝐹𝑈) ∈ (SubGrp‘𝑆) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑆))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑆)𝑏) ∈ (𝐹𝑈))))
557, 50, 54mpbir2and 709 1 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑌) → (𝐹𝑈) ∈ 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wral 3063  ccnv 5579  cima 5583  Fun wfun 6412   Fn wfn 6413  wf 6414  cfv 6418  (class class class)co 7255  Basecbs 16840  Scalarcsca 16891   ·𝑠 cvsca 16892  SubGrpcsubg 18664   GrpHom cghm 18746  LModclmod 20038  LSubSpclss 20108   LMHom clmhm 20196
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-ress 16868  df-plusg 16901  df-0g 17069  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-grp 18495  df-minusg 18496  df-sbg 18497  df-subg 18667  df-ghm 18747  df-mgp 19636  df-ur 19653  df-ring 19700  df-lmod 20040  df-lss 20109  df-lmhm 20199
This theorem is referenced by:  lmhmlsp  20226  lmhmkerlss  20228  lnmepi  40826
  Copyright terms: Public domain W3C validator