dvhopvadd - Mathbox for Norm Megill

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

Theorem dvhopvadd 40477

Description: The vector sum operation for the constructed full vector space H. (Contributed by NM, 21-Feb-2014.) (Revised by Mario Carneiro, 6-May-2015.)

**Hypotheses**
Ref	Expression
dvhvadd.h	⊢ 𝐻 = (LHyp‘𝐾)
dvhvadd.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dvhvadd.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
dvhvadd.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dvhvadd.f	⊢ 𝐷 = (Scalar‘𝑈)
dvhvadd.s	⊢ + = (+_g‘𝑈)
dvhvadd.p	⊢ ⨣ = (+_g‘𝐷)

**Assertion**
Ref	Expression
dvhopvadd	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨(𝐹 ∘ 𝐺), (𝑄 ⨣ 𝑅)⟩)

**Proof of Theorem dvhopvadd**
Step	Hyp	Ref	Expression
1		simp1 1133	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		opelxpi 5706	. . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → ⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸))
3	2	3ad2ant2 1131	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸))
4		opelxpi 5706	. . . 4 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸) → ⟨𝐺, 𝑅⟩ ∈ (𝑇 × 𝐸))
5	4	3ad2ant3 1132	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ⟨𝐺, 𝑅⟩ ∈ (𝑇 × 𝐸))
6		dvhvadd.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
7		dvhvadd.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		dvhvadd.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
9		dvhvadd.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
10		dvhvadd.f	. . . 4 ⊢ 𝐷 = (Scalar‘𝑈)
11		dvhvadd.s	. . . 4 ⊢ + = (+_g‘𝑈)
12		dvhvadd.p	. . . 4 ⊢ ⨣ = (+_g‘𝐷)
13	6, 7, 8, 9, 10, 11, 12	dvhvadd 40476	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸) ∧ ⟨𝐺, 𝑅⟩ ∈ (𝑇 × 𝐸))) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩)
14	1, 3, 5, 13	syl12anc 834	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩)
15		op1stg 7986	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → (1^st ‘⟨𝐹, 𝑄⟩) = 𝐹)
16	15	3ad2ant2 1131	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (1^st ‘⟨𝐹, 𝑄⟩) = 𝐹)
17		op1stg 7986	. . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸) → (1^st ‘⟨𝐺, 𝑅⟩) = 𝐺)
18	17	3ad2ant3 1132	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (1^st ‘⟨𝐺, 𝑅⟩) = 𝐺)
19	16, 18	coeq12d 5858	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)) = (𝐹 ∘ 𝐺))
20		op2ndg 7987	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → (2^nd ‘⟨𝐹, 𝑄⟩) = 𝑄)
21	20	3ad2ant2 1131	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (2^nd ‘⟨𝐹, 𝑄⟩) = 𝑄)
22		op2ndg 7987	. . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸) → (2^nd ‘⟨𝐺, 𝑅⟩) = 𝑅)
23	22	3ad2ant3 1132	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (2^nd ‘⟨𝐺, 𝑅⟩) = 𝑅)
24	21, 23	oveq12d 7423	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩)) = (𝑄 ⨣ 𝑅))
25	19, 24	opeq12d 4876	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩ = ⟨(𝐹 ∘ 𝐺), (𝑄 ⨣ 𝑅)⟩)
26	14, 25	eqtrd 2766	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨(𝐹 ∘ 𝐺), (𝑄 ⨣ 𝑅)⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ⟨cop 4629 × cxp 5667 ∘ ccom 5673 ‘cfv 6537 (class class class)co 7405 1^st c1st 7972 2^nd c2nd 7973 +_gcplusg 17206 Scalarcsca 17209 HLchlt 38733 LHypclh 39368 LTrncltrn 39485 TEndoctendo 40136 DVecHcdvh 40462

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 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 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 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-tp 4628 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-n0 12477 df-z 12563 df-uz 12827 df-fz 13491 df-struct 17089 df-slot 17124 df-ndx 17136 df-base 17154 df-plusg 17219 df-mulr 17220 df-sca 17222 df-vsca 17223 df-edring 40141 df-dvech 40463

This theorem is referenced by: dvhopvadd2 40478 dvhgrp 40491 dvh0g 40495 diblsmopel 40555 cdlemn4 40582 cdlemn6 40586 dihopelvalcpre 40632

W3C validator