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 40685

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 2725	. . . 4 ⊢ ((LTrn‘𝐾)‘𝑊) = ((LTrn‘𝐾)‘𝑊)
3		eqid 2725	. . . 4 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
4		dvhsca.d	. . . 4 ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊)
5		dvhsca.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
6	1, 2, 3, 4, 5	dvhset 40684	. . 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 6900	. 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 6910	. . 3 ⊢ 𝐷 ∈ V
10		eqid 2725	. . . 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 17312	. . 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 2790	1 ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝐹 = 𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 Vcvv 3461 ∪ cun 3942 {csn 4630 {ctp 4634 ⟨cop 4636 ↦ cmpt 5232 × cxp 5676 ∘ ccom 5682 ‘cfv 6549 ∈ cmpo 7421 1^st c1st 7992 2^nd c2nd 7993 ndxcnx 17165 Basecbs 17183 +_gcplusg 17236 Scalarcsca 17239 ·_𝑠 cvsca 17240 LHypclh 39587 LTrncltrn 39704 TEndoctendo 40355 EDRingcedring 40356 DVecHcdvh 40681

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-1st 7994 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-n0 12506 df-z 12592 df-uz 12856 df-fz 13520 df-struct 17119 df-slot 17154 df-ndx 17166 df-base 17184 df-plusg 17249 df-sca 17252 df-vsca 17253 df-dvech 40682

This theorem is referenced by: dvhbase 40686 dvhfplusr 40687 dvhfmulr 40688 dvhfvadd 40694 dvhvaddass 40700 tendoinvcl 40707 tendolinv 40708 tendorinv 40709 dvhgrp 40710 dvhlveclem 40711 cdlemn4 40801 hlhilsbase2 41549 hlhilsplus2 41550 hlhilsmul2 41551

W3C validator