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 40622

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 5709	. . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → ⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸))
3	2	3ad2ant2 1131	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸))
4		opelxpi 5709	. . . 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 40621	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (⟨𝐹, 𝑄⟩ ∈ (𝑇 × 𝐸) ∧ ⟨𝐺, 𝑅⟩ ∈ (𝑇 × 𝐸))) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩)
14	1, 3, 5, 13	syl12anc 835	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩)
15		op1stg 8003	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → (1^st ‘⟨𝐹, 𝑄⟩) = 𝐹)
16	15	3ad2ant2 1131	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (1^st ‘⟨𝐹, 𝑄⟩) = 𝐹)
17		op1stg 8003	. . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸) → (1^st ‘⟨𝐺, 𝑅⟩) = 𝐺)
18	17	3ad2ant3 1132	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (1^st ‘⟨𝐺, 𝑅⟩) = 𝐺)
19	16, 18	coeq12d 5861	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)) = (𝐹 ∘ 𝐺))
20		op2ndg 8004	. . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) → (2^nd ‘⟨𝐹, 𝑄⟩) = 𝑄)
21	20	3ad2ant2 1131	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (2^nd ‘⟨𝐹, 𝑄⟩) = 𝑄)
22		op2ndg 8004	. . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸) → (2^nd ‘⟨𝐺, 𝑅⟩) = 𝑅)
23	22	3ad2ant3 1132	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (2^nd ‘⟨𝐺, 𝑅⟩) = 𝑅)
24	21, 23	oveq12d 7434	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩)) = (𝑄 ⨣ 𝑅))
25	19, 24	opeq12d 4877	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → ⟨((1^st ‘⟨𝐹, 𝑄⟩) ∘ (1^st ‘⟨𝐺, 𝑅⟩)), ((2^nd ‘⟨𝐹, 𝑄⟩) ⨣ (2^nd ‘⟨𝐺, 𝑅⟩))⟩ = ⟨(𝐹 ∘ 𝐺), (𝑄 ⨣ 𝑅)⟩)
26	14, 25	eqtrd 2765	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑄 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑅 ∈ 𝐸)) → (⟨𝐹, 𝑄⟩ + ⟨𝐺, 𝑅⟩) = ⟨(𝐹 ∘ 𝐺), (𝑄 ⨣ 𝑅)⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ⟨cop 4630 × cxp 5670 ∘ ccom 5676 ‘cfv 6543 (class class class)co 7416 1^st c1st 7989 2^nd c2nd 7990 +_gcplusg 17232 Scalarcsca 17235 HLchlt 38878 LHypclh 39513 LTrncltrn 39630 TEndoctendo 40281 DVecHcdvh 40607

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 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

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 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-n0 12503 df-z 12589 df-uz 12853 df-fz 13517 df-struct 17115 df-slot 17150 df-ndx 17162 df-base 17180 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-edring 40286 df-dvech 40608

This theorem is referenced by: dvhopvadd2 40623 dvhgrp 40636 dvh0g 40640 diblsmopel 40700 cdlemn4 40727 cdlemn6 40731 dihopelvalcpre 40777

W3C validator