dvhopvsca - Mathbox for Norm Megill

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

Theorem dvhopvsca 41983

Description: Scalar product operation for the constructed full vector space H. (Contributed by NM, 20-Feb-2014.)

**Hypotheses**
Ref	Expression
dvhfvsca.h	⊢ 𝐻 = (LHyp‘𝐾)
dvhfvsca.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dvhfvsca.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
dvhfvsca.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dvhfvsca.s	⊢ · = ( ·_𝑠 ‘𝑈)

**Assertion**
Ref	Expression
dvhopvsca	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝑅 · ⟨𝐹, 𝑋⟩) = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑋)⟩)

**Proof of Theorem dvhopvsca**
Step	Hyp	Ref	Expression
1		simpl 488	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻))
2		simpr1 1213	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → 𝑅 ∈ 𝐸)
3		simpr2 1214	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → 𝐹 ∈ 𝑇)
4		simpr3 1215	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → 𝑋 ∈ 𝐸)
5		opelxpi 5696	. . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸) → ⟨𝐹, 𝑋⟩ ∈ (𝑇 × 𝐸))
6	3, 4, 5	syl2anc 596	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → ⟨𝐹, 𝑋⟩ ∈ (𝑇 × 𝐸))
7		dvhfvsca.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
8		dvhfvsca.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
9		dvhfvsca.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
10		dvhfvsca.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
11		dvhfvsca.s	. . . 4 ⊢ · = ( ·_𝑠 ‘𝑈)
12	7, 8, 9, 10, 11	dvhvsca 41982	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ ⟨𝐹, 𝑋⟩ ∈ (𝑇 × 𝐸))) → (𝑅 · ⟨𝐹, 𝑋⟩) = ⟨(𝑅‘(1^st ‘⟨𝐹, 𝑋⟩)), (𝑅 ∘ (2^nd ‘⟨𝐹, 𝑋⟩))⟩)
13	1, 2, 6, 12	syl12anc 850	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝑅 · ⟨𝐹, 𝑋⟩) = ⟨(𝑅‘(1^st ‘⟨𝐹, 𝑋⟩)), (𝑅 ∘ (2^nd ‘⟨𝐹, 𝑋⟩))⟩)
14		op1stg 8002	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸) → (1^st ‘⟨𝐹, 𝑋⟩) = 𝐹)
15	3, 4, 14	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (1^st ‘⟨𝐹, 𝑋⟩) = 𝐹)
16	15	fveq2d 6886	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝑅‘(1^st ‘⟨𝐹, 𝑋⟩)) = (𝑅‘𝐹))
17		op2ndg 8003	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸) → (2^nd ‘⟨𝐹, 𝑋⟩) = 𝑋)
18	3, 4, 17	syl2anc 596	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (2^nd ‘⟨𝐹, 𝑋⟩) = 𝑋)
19	18	coeq2d 5846	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝑅 ∘ (2^nd ‘⟨𝐹, 𝑋⟩)) = (𝑅 ∘ 𝑋))
20	16, 19	opeq12d 4844	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → ⟨(𝑅‘(1^st ‘⟨𝐹, 𝑋⟩)), (𝑅 ∘ (2^nd ‘⟨𝐹, 𝑋⟩))⟩ = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑋)⟩)
21	13, 20	eqtrd 2797	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝑋 ∈ 𝐸)) → (𝑅 · ⟨𝐹, 𝑋⟩) = ⟨(𝑅‘𝐹), (𝑅 ∘ 𝑋)⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⟨cop 4593 × cxp 5657 ∘ ccom 5663 ‘cfv 6537 (class class class)co 7417 1^st c1st 7988 2^nd c2nd 7989 ·_𝑠 cvsca 17352 LHypclh 40865 LTrncltrn 40982 TEndoctendo 41633 DVecHcdvh 41959

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-n0 12533 df-z 12620 df-uz 12892 df-fz 13566 df-struct 17245 df-slot 17280 df-ndx 17292 df-base 17308 df-plusg 17361 df-sca 17364 df-vsca 17365 df-dvech 41960

This theorem is used by: dvhlveclem 41989 dib1dim2 42049 diclspsn 42075 dih1dimatlem 42210

W3C validator