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

Theorem lmhmima 20493
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 20477 . . 3 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
2 lmhmlmod1 20479 . . . 4 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
3 simpr 485 . . . 4 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝑈𝑋)
4 lmhmima.x . . . . 5 𝑋 = (LSubSp‘𝑆)
54lsssubg 20403 . . . 4 ((𝑆 ∈ LMod ∧ 𝑈𝑋) → 𝑈 ∈ (SubGrp‘𝑆))
62, 3, 5syl2an2r 683 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝑈 ∈ (SubGrp‘𝑆))
7 ghmima 19020 . . 3 ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝑈 ∈ (SubGrp‘𝑆)) → (𝐹𝑈) ∈ (SubGrp‘𝑇))
81, 6, 7syl2an2r 683 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (𝐹𝑈) ∈ (SubGrp‘𝑇))
9 eqid 2736 . . . . . . . . . 10 (Base‘𝑆) = (Base‘𝑆)
10 eqid 2736 . . . . . . . . . 10 (Base‘𝑇) = (Base‘𝑇)
119, 10lmhmf 20480 . . . . . . . . 9 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
1211adantr 481 . . . . . . . 8 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
13 ffn 6665 . . . . . . . 8 (𝐹:(Base‘𝑆)⟶(Base‘𝑇) → 𝐹 Fn (Base‘𝑆))
1412, 13syl 17 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝐹 Fn (Base‘𝑆))
159, 4lssss 20382 . . . . . . . 8 (𝑈𝑋𝑈 ⊆ (Base‘𝑆))
163, 15syl 17 . . . . . . 7 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝑈 ⊆ (Base‘𝑆))
1714, 16fvelimabd 6912 . . . . . 6 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (𝑏 ∈ (𝐹𝑈) ↔ ∃𝑐𝑈 (𝐹𝑐) = 𝑏))
1817adantr 481 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (𝑏 ∈ (𝐹𝑈) ↔ ∃𝑐𝑈 (𝐹𝑐) = 𝑏))
19 simpll 765 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝐹 ∈ (𝑆 LMHom 𝑇))
20 eqid 2736 . . . . . . . . . . . . . . . 16 (Scalar‘𝑆) = (Scalar‘𝑆)
21 eqid 2736 . . . . . . . . . . . . . . . 16 (Scalar‘𝑇) = (Scalar‘𝑇)
2220, 21lmhmsca 20476 . . . . . . . . . . . . . . 15 (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
2322adantr 481 . . . . . . . . . . . . . 14 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (Scalar‘𝑇) = (Scalar‘𝑆))
2423fveq2d 6843 . . . . . . . . . . . . 13 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
2524eleq2d 2823 . . . . . . . . . . . 12 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (𝑎 ∈ (Base‘(Scalar‘𝑇)) ↔ 𝑎 ∈ (Base‘(Scalar‘𝑆))))
2625biimpa 477 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
2726adantrr 715 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑎 ∈ (Base‘(Scalar‘𝑆)))
2816sselda 3942 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑐𝑈) → 𝑐 ∈ (Base‘𝑆))
2928adantrl 714 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑐 ∈ (Base‘𝑆))
30 eqid 2736 . . . . . . . . . . 11 (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
31 eqid 2736 . . . . . . . . . . 11 ( ·𝑠𝑆) = ( ·𝑠𝑆)
32 eqid 2736 . . . . . . . . . . 11 ( ·𝑠𝑇) = ( ·𝑠𝑇)
3320, 30, 9, 31, 32lmhmlin 20481 . . . . . . . . . 10 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑐 ∈ (Base‘𝑆)) → (𝐹‘(𝑎( ·𝑠𝑆)𝑐)) = (𝑎( ·𝑠𝑇)(𝐹𝑐)))
3419, 27, 29, 33syl3anc 1371 . . . . . . . . 9 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → (𝐹‘(𝑎( ·𝑠𝑆)𝑐)) = (𝑎( ·𝑠𝑇)(𝐹𝑐)))
3519, 11, 133syl 18 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝐹 Fn (Base‘𝑆))
36 simplr 767 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑈𝑋)
3736, 15syl 17 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑈 ⊆ (Base‘𝑆))
382adantr 481 . . . . . . . . . . . 12 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝑆 ∈ LMod)
3938adantr 481 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑆 ∈ LMod)
40 simprr 771 . . . . . . . . . . 11 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → 𝑐𝑈)
4120, 31, 30, 4lssvscl 20401 . . . . . . . . . . 11 (((𝑆 ∈ LMod ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑆)) ∧ 𝑐𝑈)) → (𝑎( ·𝑠𝑆)𝑐) ∈ 𝑈)
4239, 36, 27, 40, 41syl22anc 837 . . . . . . . . . 10 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → (𝑎( ·𝑠𝑆)𝑐) ∈ 𝑈)
43 fnfvima 7179 . . . . . . . . . 10 ((𝐹 Fn (Base‘𝑆) ∧ 𝑈 ⊆ (Base‘𝑆) ∧ (𝑎( ·𝑠𝑆)𝑐) ∈ 𝑈) → (𝐹‘(𝑎( ·𝑠𝑆)𝑐)) ∈ (𝐹𝑈))
4435, 37, 42, 43syl3anc 1371 . . . . . . . . 9 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → (𝐹‘(𝑎( ·𝑠𝑆)𝑐)) ∈ (𝐹𝑈))
4534, 44eqeltrrd 2839 . . . . . . . 8 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑐𝑈)) → (𝑎( ·𝑠𝑇)(𝐹𝑐)) ∈ (𝐹𝑈))
4645anassrs 468 . . . . . . 7 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) ∧ 𝑐𝑈) → (𝑎( ·𝑠𝑇)(𝐹𝑐)) ∈ (𝐹𝑈))
47 oveq2 7361 . . . . . . . 8 ((𝐹𝑐) = 𝑏 → (𝑎( ·𝑠𝑇)(𝐹𝑐)) = (𝑎( ·𝑠𝑇)𝑏))
4847eleq1d 2822 . . . . . . 7 ((𝐹𝑐) = 𝑏 → ((𝑎( ·𝑠𝑇)(𝐹𝑐)) ∈ (𝐹𝑈) ↔ (𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈)))
4946, 48syl5ibcom 244 . . . . . 6 ((((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) ∧ 𝑐𝑈) → ((𝐹𝑐) = 𝑏 → (𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈)))
5049rexlimdva 3150 . . . . 5 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (∃𝑐𝑈 (𝐹𝑐) = 𝑏 → (𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈)))
5118, 50sylbid 239 . . . 4 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ 𝑎 ∈ (Base‘(Scalar‘𝑇))) → (𝑏 ∈ (𝐹𝑈) → (𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈)))
5251impr 455 . . 3 (((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) ∧ (𝑎 ∈ (Base‘(Scalar‘𝑇)) ∧ 𝑏 ∈ (𝐹𝑈))) → (𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈))
5352ralrimivva 3195 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈))
54 lmhmlmod2 20478 . . . 4 (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
5554adantr 481 . . 3 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → 𝑇 ∈ LMod)
56 eqid 2736 . . . 4 (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
57 lmhmima.y . . . 4 𝑌 = (LSubSp‘𝑇)
5821, 56, 10, 32, 57islss4 20408 . . 3 (𝑇 ∈ LMod → ((𝐹𝑈) ∈ 𝑌 ↔ ((𝐹𝑈) ∈ (SubGrp‘𝑇) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈))))
5955, 58syl 17 . 2 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → ((𝐹𝑈) ∈ 𝑌 ↔ ((𝐹𝑈) ∈ (SubGrp‘𝑇) ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑇))∀𝑏 ∈ (𝐹𝑈)(𝑎( ·𝑠𝑇)𝑏) ∈ (𝐹𝑈))))
608, 53, 59mpbir2and 711 1 ((𝐹 ∈ (𝑆 LMHom 𝑇) ∧ 𝑈𝑋) → (𝐹𝑈) ∈ 𝑌)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3062  wrex 3071  wss 3908  cima 5634   Fn wfn 6488  wf 6489  cfv 6493  (class class class)co 7353  Basecbs 17075  Scalarcsca 17128   ·𝑠 cvsca 17129  SubGrpcsubg 18913   GrpHom cghm 18996  LModclmod 20307  LSubSpclss 20377   LMHom clmhm 20465
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-rep 5240  ax-sep 5254  ax-nul 5261  ax-pow 5318  ax-pr 5382  ax-un 7668  ax-cnex 11103  ax-resscn 11104  ax-1cn 11105  ax-icn 11106  ax-addcl 11107  ax-addrcl 11108  ax-mulcl 11109  ax-mulrcl 11110  ax-mulcom 11111  ax-addass 11112  ax-mulass 11113  ax-distr 11114  ax-i2m1 11115  ax-1ne0 11116  ax-1rid 11117  ax-rnegex 11118  ax-rrecex 11119  ax-cnre 11120  ax-pre-lttri 11121  ax-pre-lttrn 11122  ax-pre-ltadd 11123  ax-pre-mulgt0 11124
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  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 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3351  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-tr 5221  df-id 5529  df-eprel 5535  df-po 5543  df-so 5544  df-fr 5586  df-we 5588  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6251  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7309  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7799  df-1st 7917  df-2nd 7918  df-frecs 8208  df-wrecs 8239  df-recs 8313  df-rdg 8352  df-er 8644  df-en 8880  df-dom 8881  df-sdom 8882  df-pnf 11187  df-mnf 11188  df-xr 11189  df-ltxr 11190  df-le 11191  df-sub 11383  df-neg 11384  df-nn 12150  df-2 12212  df-sets 17028  df-slot 17046  df-ndx 17058  df-base 17076  df-ress 17105  df-plusg 17138  df-0g 17315  df-mgm 18489  df-sgrp 18538  df-mnd 18549  df-grp 18743  df-minusg 18744  df-sbg 18745  df-subg 18916  df-ghm 18997  df-mgp 19888  df-ur 19905  df-ring 19952  df-lmod 20309  df-lss 20378  df-lmhm 20468
This theorem is referenced by:  lmhmlsp  20495  lmhmrnlss  20496
  Copyright terms: Public domain W3C validator