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

Theorem idlmhm 21321
Description: The identity function on a module is linear. (Contributed by Stefan O'Rear, 4-Sep-2015.)
Hypothesis
Ref Expression
idlmhm.b 𝐵 = (Base‘𝑀)
Assertion
Ref Expression
idlmhm (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 LMHom 𝑀))

Proof of Theorem idlmhm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 idlmhm.b . 2 𝐵 = (Base‘𝑀)
2 eqid 2760 . 2 ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
3 eqid 2760 . 2 (Scalar‘𝑀) = (Scalar‘𝑀)
4 eqid 2760 . 2 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
5 id 23 . 2 (𝑀 ∈ LMod → 𝑀 ∈ LMod)
6 eqidd 2761 . 2 (𝑀 ∈ LMod → (Scalar‘𝑀) = (Scalar‘𝑀))
7 lmodgrp 21147 . . 3 (𝑀 ∈ LMod → 𝑀 ∈ Grp)
81idghm 19450 . . 3 (𝑀 ∈ Grp → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
97, 8syl 18 . 2 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
101, 3, 2, 4lmodvscl 21158 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
11103expb 1138 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
12 fvresi 7178 . . . 4 ((𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵 → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1311, 12syl 18 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
14 fvresi 7178 . . . . 5 (𝑦 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1514ad2antll 742 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1615oveq2d 7436 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1713, 16eqtr4d 2798 . 2 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)))
181, 2, 2, 3, 3, 4, 5, 5, 6, 9, 17islmhmd 21319 1 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 LMHom 𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   I cid 5544   ↾ cres 5652  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  Scalarcsca 17436   ·𝑠 cvsca 17437  Grpcgrp 19149   GrpHom cghm 19432  LModclmod 21140   LMHom clmhm 21299
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  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-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-map 8852  df-mgm 18821  df-sgrp 18913  df-mnd 18929  df-grp 19152  df-ghm 19433  df-lmod 21142  df-lmhm 21302
This theorem is used by:  idnmhm  25078  mendring  44283
  Copyright terms: Public domain W3C validator