Theorem mendmulrfval 36776

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

Hypotheses

Ref	Expression
mendmulrfval.a	⊢ 𝐴 = (MEndo‘𝑀)
mendmulrfval.b	⊢ 𝐵 = (Base‘𝐴)

Assertion

Ref	Expression
mendmulrfval	⊢ (.r‘𝐴) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑀,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem mendmulrfval

Step	Hyp	Ref	Expression
1		mendmulrfval.a	. . . . 5 ⊢ 𝐴 = (MEndo‘𝑀)
2		mendmulrfval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐴)
3	1	mendbas 36773	. . . . . . 7 ⊢ (𝑀 LMHom 𝑀) = (Base‘𝐴)
4	2, 3	eqtr4i 2635	. . . . . 6 ⊢ 𝐵 = (𝑀 LMHom 𝑀)
5		eqid 2610	. . . . . 6 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))
6		eqid 2610	. . . . . 6 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))
7		eqid 2610	. . . . . 6 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
8		eqid 2610	. . . . . 6 ⊢ (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦)) = (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))
9	4, 5, 6, 7, 8	mendval 36772	. . . . 5 ⊢ (𝑀 ∈ V → (MEndo‘𝑀) = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩}))
10	1, 9	syl5eq 2656	. . . 4 ⊢ (𝑀 ∈ V → 𝐴 = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩}))
11	10	fveq2d 6107	. . 3 ⊢ (𝑀 ∈ V → (.r‘𝐴) = (.r‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩})))
12		fvex 6113	. . . . . 6 ⊢ (Base‘𝐴) ∈ V
13	2, 12	eqeltri 2684	. . . . 5 ⊢ 𝐵 ∈ V
14	13, 13	mpt2ex 7136	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) ∈ V
15		eqid 2610	. . . . 5 ⊢ ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩}) = ({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩})
16	15	algmulr 36769	. . . 4 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (.r‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩})))
17	14, 16	mp1i 13	. . 3 ⊢ (𝑀 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (.r‘({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘𝑓 (+g‘𝑀)𝑦))⟩, ⟨(.r‘ndx), (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))⟩} ∪ {⟨(Scalar‘ndx), (Scalar‘𝑀)⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘(Scalar‘𝑀)), 𝑦 ∈ 𝐵 ↦ (((Base‘𝑀) × {𝑥}) ∘𝑓 ( ·𝑠 ‘𝑀)𝑦))⟩})))
18	11, 17	eqtr4d 2647	. 2 ⊢ (𝑀 ∈ V → (.r‘𝐴) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)))
19		fvprc 6097	. . . . . 6 ⊢ (¬ 𝑀 ∈ V → (MEndo‘𝑀) = ∅)
20	1, 19	syl5eq 2656	. . . . 5 ⊢ (¬ 𝑀 ∈ V → 𝐴 = ∅)
21	20	fveq2d 6107	. . . 4 ⊢ (¬ 𝑀 ∈ V → (.r‘𝐴) = (.r‘∅))
22		df-mulr 15782	. . . . 5 ⊢ .r = Slot 3
23	22	str0 15739	. . . 4 ⊢ ∅ = (.r‘∅)
24	21, 23	syl6eqr 2662	. . 3 ⊢ (¬ 𝑀 ∈ V → (.r‘𝐴) = ∅)
25	20	fveq2d 6107	. . . . . . 7 ⊢ (¬ 𝑀 ∈ V → (Base‘𝐴) = (Base‘∅))
26	2, 25	syl5eq 2656	. . . . . 6 ⊢ (¬ 𝑀 ∈ V → 𝐵 = (Base‘∅))
27		base0 15740	. . . . . 6 ⊢ ∅ = (Base‘∅)
28	26, 27	syl6eqr 2662	. . . . 5 ⊢ (¬ 𝑀 ∈ V → 𝐵 = ∅)
29		mpt2eq12 6613	. . . . . 6 ⊢ ((𝐵 = ∅ ∧ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ ∅, 𝑦 ∈ ∅ ↦ (𝑥 ∘ 𝑦)))
30	29	anidms 675	. . . . 5 ⊢ (𝐵 = ∅ → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ ∅, 𝑦 ∈ ∅ ↦ (𝑥 ∘ 𝑦)))
31	28, 30	syl 17	. . . 4 ⊢ (¬ 𝑀 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = (𝑥 ∈ ∅, 𝑦 ∈ ∅ ↦ (𝑥 ∘ 𝑦)))
32		mpt20 6623	. . . 4 ⊢ (𝑥 ∈ ∅, 𝑦 ∈ ∅ ↦ (𝑥 ∘ 𝑦)) = ∅
33	31, 32	syl6eq 2660	. . 3 ⊢ (¬ 𝑀 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)) = ∅)
34	24, 33	eqtr4d 2647	. 2 ⊢ (¬ 𝑀 ∈ V → (.r‘𝐴) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦)))
35	18, 34	pm2.61i 175	1 ⊢ (.r‘𝐴) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 ∘ 𝑦))

Syntax hints:  ¬ wn 3   = wceq 1475   ∈ wcel 1977  Vcvv 3173   ∪ cun 3538  ∅c0 3874  {csn 4125  {cpr 4127  {ctp 4129  ⟨cop 4131   × cxp 5036   ∘ ccom 5042  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551   ∘_𝑓 cof 6793  3c3 10948  ndxcnx 15692  Basecbs 15695  +_gcplusg 15768  ._rcmulr 15769  Scalarcsca 15771   ·_𝑠 cvsca 15772   LMHom clmhm 18840  MEndocmend 36764

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-4 10958  df-5 10959  df-6 10960  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-struct 15697  df-ndx 15698  df-slot 15699  df-base 15700  df-plusg 15781  df-mulr 15782  df-sca 15784  df-vsca 15785  df-lmhm 18843  df-mend 36765

This theorem is referenced by:  mendmulr  36777