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

Theorem idlmhm 21346
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 2763 . 2 ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
3 eqid 2763 . 2 (Scalar‘𝑀) = (Scalar‘𝑀)
4 eqid 2763 . 2 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
5 id 23 . 2 (𝑀 ∈ LMod → 𝑀 ∈ LMod)
6 eqidd 2764 . 2 (𝑀 ∈ LMod → (Scalar‘𝑀) = (Scalar‘𝑀))
7 lmodgrp 21172 . . 3 (𝑀 ∈ LMod → 𝑀 ∈ Grp)
81idghm 19474 . . 3 (𝑀 ∈ Grp → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
97, 8syl 18 . 2 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
101, 3, 2, 4lmodvscl 21183 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
11103expb 1138 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
12 fvresi 7201 . . . 4 ((𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵 → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1311, 12syl 18 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
14 fvresi 7201 . . . . 5 (𝑦 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1514ad2antll 742 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1615oveq2d 7459 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1713, 16eqtr4d 2801 . 2 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)))
181, 2, 2, 3, 3, 4, 5, 5, 6, 9, 17islmhmd 21344 1 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 LMHom 𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   I cid 5549   ↾ cres 5657  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  Scalarcsca 17460   ·𝑠 cvsca 17461  Grpcgrp 19173   GrpHom cghm 19456  LModclmod 21165   LMHom clmhm 21324
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877  df-mgm 18845  df-sgrp 18937  df-mnd 18953  df-grp 19176  df-ghm 19457  df-lmod 21167  df-lmhm 21327
This theorem is used by:  idnmhm  25103  mendring  44382
  Copyright terms: Public domain W3C validator