Theorem mendbas 44275

Description: Base set of the module endomorphism algebra. (Contributed by Stefan O'Rear, 2-Sep-2015.)

Hypothesis

Ref	Expression
mendbas.a	⊢ 𝐴 = (MEndo‘𝑀)

Assertion

Ref	Expression
mendbas	⊢ (𝑀 LMHom 𝑀) = (Base‘𝐴)

Proof of Theorem mendbas

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

Step	Hyp	Ref	Expression
1		ovex 7453	. . . 4 ⊢ (𝑀 LMHom 𝑀) ∈ V
2		eqid 2760	. . . . 5 ⊢ ({⟨(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	algbase 44269	. . . 4 ⊢ ((𝑀 LMHom 𝑀) ∈ V → (𝑀 LMHom 𝑀) = (Base‘({⟨(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	. . 3 ⊢ (𝑀 ∈ V → (𝑀 LMHom 𝑀) = (Base‘({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})))
5		mendbas.a	. . . . 5 ⊢ 𝐴 = (MEndo‘𝑀)
6		eqid 2760	. . . . . 6 ⊢ (𝑀 LMHom 𝑀) = (𝑀 LMHom 𝑀)
7		eqid 2760	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))
8		eqid 2760	. . . . . 6 ⊢ (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))
9		eqid 2760	. . . . . 6 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
10		eqid 2760	. . . . . 6 ⊢ (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦)) = (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))
11	6, 7, 8, 9, 10	mendval 44274	. . . . 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 ( ·𝑠 ‘𝑀)𝑦))⟩}))
12	5, 11	eqtrid 2807	. . . 4 ⊢ (𝑀 ∈ V → 𝐴 = ({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩}))
13	12	fveq2d 6889	. . 3 ⊢ (𝑀 ∈ V → (Base‘𝐴) = (Base‘({⟨(Base‘ndx), (𝑀 LMHom 𝑀)⟩, ⟨(+g‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘f (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ (𝑀 LMHom 𝑀), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ (𝑀 LMHom 𝑀) ↦ (((Base‘𝑀) × {𝑥}) ∘f ( ·𝑠 ‘𝑀)𝑦))⟩})))
14	4, 13	eqtr4d 2798	. 2 ⊢ (𝑀 ∈ V → (𝑀 LMHom 𝑀) = (Base‘𝐴))
15		base0 17397	. . 3 ⊢ ∅ = (Base‘∅)
16		reldmlmhm 21305	. . . 4 ⊢ Rel dom LMHom
17	16	ovprc1 7459	. . 3 ⊢ (¬ 𝑀 ∈ V → (𝑀 LMHom 𝑀) = ∅)
18		fvprc 6877	. . . . 5 ⊢ (¬ 𝑀 ∈ V → (MEndo‘𝑀) = ∅)
19	5, 18	eqtrid 2807	. . . 4 ⊢ (¬ 𝑀 ∈ V → 𝐴 = ∅)
20	19	fveq2d 6889	. . 3 ⊢ (¬ 𝑀 ∈ V → (Base‘𝐴) = (Base‘∅))
21	15, 17, 20	3eqtr4a 2821	. 2 ⊢ (¬ 𝑀 ∈ V → (𝑀 LMHom 𝑀) = (Base‘𝐴))
22	14, 21	pm2.61i 184	1 ⊢ (𝑀 LMHom 𝑀) = (Base‘𝐴)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∪ cun 4149  ∅c0 4278  {csn 4584  {cpr 4586  {ctp 4588  ⟨cop 4834   × cxp 5648   ∘ ccom 5654  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ∘_f cof 7691  ndxcnx 17376  Basecbs 17392  +_gcplusg 17433  ._rcmulr 17434  Scalarcsca 17436   ·_𝑠 cvsca 17437   LMHom clmhm 21299  MEndocmend 44266

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  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  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-tp 4589  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  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-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-er 8720  df-en 8977  df-dom 8978  df-sdom 8979  df-fin 8980  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-nn 12339  df-2 12408  df-3 12409  df-4 12410  df-5 12411  df-6 12412  df-n0 12610  df-z 12697  df-uz 12969  df-fz 13643  df-struct 17330  df-slot 17365  df-ndx 17377  df-base 17393  df-plusg 17446  df-mulr 17447  df-sca 17449  df-vsca 17450  df-lmhm 21302  df-mend 44267

This theorem is used by:  mendplusgfval  44276  mendmulrfval  44278  mendvscafval  44281  mendring  44283  mendlmod  44284  mendassa  44285