Theorem mendsca 41014

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 6787	. . . . 5 ⊢ (Scalar‘𝑀) ∈ V
2		eqid 2738	. . . . . 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 41006	. . . . 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 13	. . . 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 2738	. . . . . 6 ⊢ (𝑀 LMHom 𝑀) = (𝑀 LMHom 𝑀)
6		eqid 2738	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))
7		eqid 2738	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))
8		eqid 2738	. . . . . 6 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
9		eqid 2738	. . . . . 6 ⊢ (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦)) = (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))
10	5, 6, 7, 8, 9	mendval 41008	. . . . 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 6778	. . . 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 2781	. . 3 ⊢ (𝑀 ∈ V → (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀)))
13		scaid 17025	. . . . . 6 ⊢ Scalar = Slot (Scalar‘ndx)
14	13	str0 16890	. . . . 5 ⊢ ∅ = (Scalar‘∅)
15	14	eqcomi 2747	. . . 4 ⊢ (Scalar‘∅) = ∅
16		eqid 2738	. . . 4 ⊢ (MEndo‘𝑀) = (MEndo‘𝑀)
17	15, 16	fveqprc 16892	. . 3 ⊢ (¬ 𝑀 ∈ V → (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀)))
18	12, 17	pm2.61i 182	. 2 ⊢ (Scalar‘𝑀) = (Scalar‘(MEndo‘𝑀))
19		mendsca.s	. 2 ⊢ 𝑆 = (Scalar‘𝑀)
20		mendsca.a	. . 3 ⊢ 𝐴 = (MEndo‘𝑀)
21	20	fveq2i 6777	. 2 ⊢ (Scalar‘𝐴) = (Scalar‘(MEndo‘𝑀))
22	18, 19, 21	3eqtr4i 2776	1 ⊢ 𝑆 = (Scalar‘𝐴)

Syntax hints:   = wceq 1539   ∈ wcel 2106  Vcvv 3432   ∪ cun 3885  ∅c0 4256  {csn 4561  {cpr 4563  {ctp 4565  ⟨cop 4567   × cxp 5587   ∘ ccom 5593  ‘cfv 6433  (class class class)co 7275   ∈ cmpo 7277   ∘_f cof 7531  ndxcnx 16894  Basecbs 16912  +_gcplusg 16962  ._rcmulr 16963  Scalarcsca 16965   ·_𝑠 cvsca 16966   LMHom clmhm 20281  MEndocmend 41000

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-of 7533  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-3 12037  df-4 12038  df-5 12039  df-6 12040  df-n0 12234  df-z 12320  df-uz 12583  df-fz 13240  df-struct 16848  df-slot 16883  df-ndx 16895  df-base 16913  df-plusg 16975  df-mulr 16976  df-sca 16978  df-vsca 16979  df-mend 41001

This theorem is referenced by:  mendlmod  41018  mendassa  41019