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

Theorem idlmhm 21296
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 2761 . 2 ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
3 eqid 2761 . 2 (Scalar‘𝑀) = (Scalar‘𝑀)
4 eqid 2761 . 2 (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
5 id 23 . 2 (𝑀 ∈ LMod → 𝑀 ∈ LMod)
6 eqidd 2762 . 2 (𝑀 ∈ LMod → (Scalar‘𝑀) = (Scalar‘𝑀))
7 lmodgrp 21122 . . 3 (𝑀 ∈ LMod → 𝑀 ∈ Grp)
81idghm 19425 . . 3 (𝑀 ∈ Grp → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
97, 8syl 18 . 2 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 GrpHom 𝑀))
101, 3, 2, 4lmodvscl 21133 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
11103expb 1138 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
12 fvresi 7170 . . . 4 ((𝑥( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵 → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1311, 12syl 18 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
14 fvresi 7170 . . . . 5 (𝑦 ∈ 𝐵 → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1514ad2antll 742 . . . 4 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘𝑦) = 𝑦)
1615oveq2d 7428 . . 3 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)) = (𝑥( ·𝑠 ‘𝑀)𝑦))
1713, 16eqtr4d 2799 . 2 ((𝑀 ∈ LMod ∧ (𝑥 ∈ (Base‘(Scalar‘𝑀)) ∧ 𝑦 ∈ 𝐵)) → (( I ↾ 𝐵)‘(𝑥( ·𝑠 ‘𝑀)𝑦)) = (𝑥( ·𝑠 ‘𝑀)(( I ↾ 𝐵)‘𝑦)))
181, 2, 2, 3, 3, 4, 5, 5, 6, 9, 17islmhmd 21294 1 (𝑀 ∈ LMod → ( I ↾ 𝐵) ∈ (𝑀 LMHom 𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   I cid 5545   ↾ cres 5653  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Scalarcsca 17411   ·𝑠 cvsca 17412  Grpcgrp 19124   GrpHom cghm 19407  LModclmod 21115   LMHom clmhm 21274
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-map 8833  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127  df-ghm 19408  df-lmod 21117  df-lmhm 21277
This theorem is used by:  idnmhm  25053  mendring  44148
  Copyright terms: Public domain W3C validator