Theorem mendsca 43838

Description: The module endomorphism algebra has the same scalars as the underlying module. (Contributed by Stefan O'Rear, 2-Sep-2015.) (Proof shortened by AV, 31-Oct-2024.)

Hypotheses

Ref	Expression
mendsca.a	⊢ 𝐴 = (MEndo‘𝑀)
mendsca.s	⊢ 𝑆 = (Scalar‘𝑀)

Assertion

Ref	Expression
mendsca	⊢ 𝑆 = (Scalar‘𝐴)

Proof of Theorem mendsca

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvex 6895	. . . . 5 ⊢ (Scalar‘𝑀) ∈ V
2		eqid 2769	. . . . . 6 ⊢ ({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩}) = ({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})
3	2	algsca 43830	. . . . 5 ⊢ ((Scalar‘𝑀) ∈ V → (Scalar‘𝑀) = (Scalar‘({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})))
4	1, 3	mp1i 14	. . . 4 ⊢ (𝑀 ∈ V → (Scalar‘𝑀) = (Scalar‘({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})))
5		eqid 2769	. . . . . 6 ⊢ (𝑀 LMHom 𝑀) = (𝑀 LMHom 𝑀)
6		eqid 2769	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))
7		eqid 2769	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))
8		eqid 2769	. . . . . 6 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
9		eqid 2769	. . . . . 6 ⊢ (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦)) = (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))
10	5, 6, 7, 8, 9	mendval 43832	. . . . 5 ⊢ (𝑀 ∈ V → (MEndo‘𝑀) = ({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩}))
11	10	fveq2d 6886	. . . 4 ⊢ (𝑀 ∈ V → (Scalar‘(MEndo‘𝑀)) = (Scalar‘({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})))
12	4, 11	eqtr4d 2807	. . 3 ⊢ (𝑀 ∈ V → (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀)))
13		scaid 17368	. . . . . 6 ⊢ Scalar = Slot (Scalar‘ndx)
14	13	str0 17249	. . . . 5 ⊢ ∅ = (Scalar‘∅)
15	14	eqcomi 2778	. . . 4 ⊢ (Scalar‘∅) = ∅
16		eqid 2769	. . . 4 ⊢ (MEndo‘𝑀) = (MEndo‘𝑀)
17	15, 16	fveqprc 17251	. . 3 ⊢ (¬ 𝑀 ∈ V → (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀)))
18	12, 17	pm2.61i 184	. 2 ⊢ (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀))
19		mendsca.s	. 2 ⊢ 𝑆 = (Scalar‘𝑀)
20		mendsca.a	. . 3 ⊢ 𝐴 = (MEndo‘𝑀)
21	20	fveq2i 6885	. 2 ⊢ (Scalar‘𝐴) = (Scalar‘(MEndo‘𝑀))
22	18, 19, 21	3eqtr4i 2802	1 ⊢ 𝑆 = (Scalar‘𝐴)

Syntax hints:   = wceq 1567   ∈ wcel 2149  Vcvv 3463   ∪ cun 3911  ∅c0 4294  {csn 4594  {cpr 4596  {ctp 4598  ⟨cop 4600   × cxp 5660   ∘ ccom 5666  ‘cfv 6537  (class class class)co 7411   ∈ cmpo 7413   ∘_f cof 7673  ndxcnx 17253  Basecbs 17269  +_gcplusg 17310  ._rcmulr 17311  Scalarcsca 17313   ·_𝑠 cvsca 17314   LMHom clmhm 21118  MEndocmend 43824

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-n0 12505  df-z 12592  df-uz 12863  df-fz 13536  df-struct 17207  df-slot 17242  df-ndx 17254  df-base 17270  df-plusg 17323  df-mulr 17324  df-sca 17326  df-vsca 17327  df-mend 43825

This theorem is referenced by:  mendlmod  43842  mendassa  43843