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

Theorem lmhmima 21323
Description: The 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
lmhmima ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (𝐹 “ 𝑈) ∈ 𝑌)

Proof of Theorem lmhmima
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lmghm 21307 . . 3 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
2 lmhmlmod1 21309 . . . 4 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
3 simpr 490 . . . 4 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝑈 ∈ 𝑋)
4 lmhmima.x . . . . 5 𝑋 = (LSubSp‘𝑆)
54lsssubg 21233 . . . 4 ((𝑆 ∈ LMod ∧ 𝑈 ∈ 𝑋) → 𝑈 ∈ (SubGrp‘𝑆))
62, 3, 5syl2an2r 698 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝑈 ∈ (SubGrp‘𝑆))
7 ghmima 19452 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ (SubGrp‘𝑆)) → (𝐹 “ 𝑈) ∈ (SubGrp‘𝑇))
81, 6, 7syl2an2r 698 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (𝐹 “ 𝑈) ∈ (SubGrp‘𝑇))
9 eqid 2760 . . . . . . . . . 10 (Base‘𝑆) = (Base‘𝑆)
10 eqid 2760 . . . . . . . . . 10 (Base‘𝑇) = (Base‘𝑇)
119, 10lmhmf 21310 . . . . . . . . 9 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1211adantr 486 . . . . . . . 8 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
13 ffn 6709 . . . . . . . 8 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 Fn (Base‘𝑆))
1412, 13syl 18 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝐹 Fn (Base‘𝑆))
159, 4lssss 21212 . . . . . . . 8 (𝑈 ∈ 𝑋 → 𝑈 ⊆ (Base‘𝑆))
163, 15syl 18 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝑈 ⊆ (Base‘𝑆))
1714, 16fvelimabd 6958 . . . . . 6 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (𝑏 ∈ (𝐹 “ 𝑈) ↔ ∃𝑐 ∈ 𝑈 (𝐹‘𝑐) = 𝑏))
1817adantr 486 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (𝑏 ∈ (𝐹 “ 𝑈) ↔ ∃𝑐 ∈ 𝑈 (𝐹‘𝑐) = 𝑏))
19 simpll 779 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝐹 ∈ (𝑆 LMHom 𝑇))
20 eqid 2760 . . . . . . . . . . . . . . . 16 (Scalar‘𝑆) = (Scalar‘𝑆)
21 eqid 2760 . . . . . . . . . . . . . . . 16 (Scalar‘𝑇) = (Scalar‘𝑇)
2220, 21lmhmsca 21306 . . . . . . . . . . . . . . 15 (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
2322adantr 486 . . . . . . . . . . . . . 14 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (Scalar‘𝑇) = (Scalar‘𝑆))
2423fveq2d 6889 . . . . . . . . . . . . 13 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
2524eleq2d 2846 . . . . . . . . . . . 12 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (𝑎 ∈ (Base‘(Scalar‘𝑇)) ↔ 𝑎 ∈ (Base‘(Scalar‘𝑆))))
2625biimpa 482 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
2726adantrr 730 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
2816sselda 3908 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑐 ∈ 𝑈) → 𝑐 ∈ (Base‘𝑆))
2928adantrl 729 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑐 ∈ (Base‘𝑆))
30 eqid 2760 . . . . . . . . . . 11 (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
31 eqid 2760 . . . . . . . . . . 11 ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆)
32 eqid 2760 . . . . . . . . . . 11 ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑇)
3320, 30, 9, 31, 32lmhmlin 21311 . . . . . . . . . 10 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑐 ∈ (Base‘𝑆)) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑐)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)))
3419, 27, 29, 33syl3anc 1398 . . . . . . . . 9 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑐)) = (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)))
3519, 11, 133syl 19 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝐹 Fn (Base‘𝑆))
36 simplr 781 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑈 ∈ 𝑋)
3736, 15syl 18 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑈 ⊆ (Base‘𝑆))
382adantr 486 . . . . . . . . . . . 12 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝑆 ∈ LMod)
3938adantr 486 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑆 ∈ LMod)
40 simprr 785 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → 𝑐 ∈ 𝑈)
4120, 31, 30, 4lssvscl 21231 . . . . . . . . . . 11 (((𝑆 ∈ LMod ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑐 ∈ 𝑈)) → (𝑎( ·𝑠 ‘𝑆)𝑐) ∈ 𝑈)
4239, 36, 27, 40, 41syl22anc 852 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → (𝑎( ·𝑠 ‘𝑆)𝑐) ∈ 𝑈)
43 fnfvima 7239 . . . . . . . . . 10 ((𝐹 Fn (Base‘𝑆) ∧ 𝑈 ⊆ (Base‘𝑆) ∧ (𝑎( ·𝑠 ‘𝑆)𝑐) ∈ 𝑈) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑐)) ∈ (𝐹 “ 𝑈))
4435, 37, 42, 43syl3anc 1398 . . . . . . . . 9 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → (𝐹‘(𝑎( ·𝑠 ‘𝑆)𝑐)) ∈ (𝐹 “ 𝑈))
4534, 44eqeltrrd 2861 . . . . . . . 8 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐 ∈ 𝑈)) → (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)) ∈ (𝐹 “ 𝑈))
4645anassrs 473 . . . . . . 7 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) ∧ 𝑐 ∈ 𝑈) → (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)) ∈ (𝐹 “ 𝑈))
47 oveq2 7428 . . . . . . . 8 ((𝐹‘𝑐) = 𝑏 → (𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)) = (𝑎( ·𝑠 ‘𝑇)𝑏))
4847eleq1d 2845 . . . . . . 7 ((𝐹‘𝑐) = 𝑏 → ((𝑎( ·𝑠 ‘𝑇)(𝐹‘𝑐)) ∈ (𝐹 “ 𝑈) ↔ (𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈)))
4946, 48syl5ibcom 248 . . . . . 6 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) ∧ 𝑐 ∈ 𝑈) → ((𝐹‘𝑐) = 𝑏 → (𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈)))
5049rexlimdva 3163 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (∃𝑐 ∈ 𝑈 (𝐹‘𝑐) = 𝑏 → (𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈)))
5118, 50sylbid 243 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (𝑏 ∈ (𝐹 “ 𝑈) → (𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈)))
5251impr 460 . . 3 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑏 ∈ (𝐹 “ 𝑈))) → (𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈))
5352ralrimivva 3205 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹 “ 𝑈)(𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈))
54 lmhmlmod2 21308 . . . 4 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
5554adantr 486 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → 𝑇 ∈ LMod)
56 eqid 2760 . . . 4 (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
57 lmhmima.y . . . 4 𝑌 = (LSubSp‘𝑇)
5821, 56, 10, 32, 57islss4 21238 . . 3 (𝑇 ∈ LMod → ((𝐹 “ 𝑈) ∈ 𝑌 ↔ ((𝐹 “ 𝑈) ∈ (SubGrp‘𝑇) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹 “ 𝑈)(𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈))))
5955, 58syl 18 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → ((𝐹 “ 𝑈) ∈ 𝑌 ↔ ((𝐹 “ 𝑈) ∈ (SubGrp‘𝑇) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹 “ 𝑈)(𝑎( ·𝑠 ‘𝑇)𝑏) ∈ (𝐹 “ 𝑈))))
608, 53, 59mpbir2and 726 1 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈 ∈ 𝑋) → (𝐹 “ 𝑈) ∈ 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   “ cima 5653   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17388  Scalarcsca 17432   ·𝑠 cvsca 17433  SubGrpcsubg 19331   GrpHom cghm 19428  LModclmod 21136  LSubSpclss 21207   LMHom clmhm 21295
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 11257  ax-resscn 11258  ax-1cn 11259  ax-icn 11260  ax-addcl 11261  ax-addrcl 11262  ax-mulcl 11263  ax-mulrcl 11264  ax-mulcom 11265  ax-addass 11266  ax-mulass 11267  ax-distr 11268  ax-i2m1 11269  ax-1ne0 11270  ax-1rid 11271  ax-rnegex 11272  ax-rrecex 11273  ax-cnre 11274  ax-pre-lttri 11275  ax-pre-lttrn 11276  ax-pre-ltadd 11277  ax-pre-mulgt0 11278
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 4584  df-pr 4586  df-op 4590  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 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-er 8718  df-map 8850  df-en 8975  df-dom 8976  df-sdom 8977  df-pnf 11346  df-mnf 11347  df-xr 11348  df-ltxr 11349  df-le 11350  df-sub 11544  df-neg 11545  df-nn 12337  df-2 12406  df-sets 17343  df-slot 17361  df-ndx 17373  df-base 17389  df-ress 17410  df-plusg 17442  df-0g 17613  df-mgm 18817  df-sgrp 18909  df-mnd 18925  df-grp 19148  df-minusg 19149  df-sbg 19150  df-subg 19334  df-ghm 19429  df-mgp 20362  df-ur 20409  df-ring 20462  df-lmod 21138  df-lss 21208  df-lmhm 21298
This theorem is used by:  lmhmlsp  21325  lmhmrnlss  21326
  Copyright terms: Public domain W3C validator