dvhsca - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvhsca		Structured version Visualization version GIF version

Theorem dvhsca 41101

Description: The ring of scalars of the constructed full vector space H. (Contributed by NM, 22-Jun-2014.)

**Hypotheses**
Ref	Expression
dvhsca.h	⊢ 𝐻 = (LHyp‘𝐾)
dvhsca.d	⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊)
dvhsca.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dvhsca.f	⊢ 𝐹 = (Scalar‘𝑈)

**Assertion**
Ref	Expression
dvhsca	⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝐹 = 𝐷)

Proof of Theorem dvhsca Dummy variables 𝑓 𝑔 ℎ 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvhsca.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		eqid 2735	. . . 4 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊)
3		eqid 2735	. . . 4 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
4		dvhsca.d	. . . 4 ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊)
5		dvhsca.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	dvhset 41100	. . 3 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝑈 = ({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩}))
7	6	fveq2d 6880	. 2 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → (Scalar‘𝑈) = (Scalar‘({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩})))
8		dvhsca.f	. 2 ⊢ 𝐹 = (Scalar‘𝑈)
9	4	fvexi 6890	. . 3 ⊢ 𝐷 ∈ V
10		eqid 2735	. . . 4 ⊢ ({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩}) = ({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩})
11	10	lmodsca 17342	. . 3 ⊢ (𝐷 ∈ V → 𝐷 = (Scalar‘({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩})))
12	9, 11	ax-mp 5	. 2 ⊢ 𝐷 = (Scalar‘({⟨(Base‘ndx), (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊))⟩, ⟨(+_g‘ndx), (𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)), 𝑔 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), (ℎ ∈ ((LTrn‘𝐾)‘𝑊) ↦ (((2^nd ‘𝑓)‘ℎ) ∘ ((2^nd ‘𝑔)‘ℎ)))⟩)⟩, ⟨(Scalar‘ndx), 𝐷⟩} ∪ {⟨( ·_𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑊), 𝑓 ∈ (((LTrn‘𝐾)‘𝑊) × ((TEndo‘𝐾)‘𝑊)) ↦ ⟨(𝑠‘(1^st ‘𝑓)), (𝑠 ∘ (2^nd ‘𝑓))⟩)⟩}))
13	7, 8, 12	3eqtr4g 2795	1 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝐹 = 𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3459 ∪ cun 3924 {csn 4601 {ctp 4605 ⟨cop 4607 ↦ cmpt 5201 × cxp 5652 ∘ ccom 5658 ‘cfv 6531 ∈ cmpo 7407 1^st c1st 7986 2^nd c2nd 7987 ndxcnx 17212 Basecbs 17228 +_gcplusg 17271 Scalarcsca 17274 ·_𝑠 cvsca 17275 LHypclh 40003 LTrncltrn 40120 TEndoctendo 40771 EDRingcedring 40772 DVecHcdvh 41097

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-nn 12241 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-n0 12502 df-z 12589 df-uz 12853 df-fz 13525 df-struct 17166 df-slot 17201 df-ndx 17213 df-base 17229 df-plusg 17284 df-sca 17287 df-vsca 17288 df-dvech 41098

This theorem is referenced by: dvhbase 41102 dvhfplusr 41103 dvhfmulr 41104 dvhfvadd 41110 dvhvaddass 41116 tendoinvcl 41123 tendolinv 41124 tendorinv 41125 dvhgrp 41126 dvhlveclem 41127 cdlemn4 41217 hlhilsbase2 41961 hlhilsplus2 41962 hlhilsmul2 41963

W3C validator