dvhvadd - Mathbox for Norm Megill

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

Theorem dvhvadd 42258

Description: The vector sum operation for the constructed full vector space H. (Contributed by NM, 11-Feb-2014.) (Revised by Mario Carneiro, 23-Jun-2014.)

**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
dvhvadd	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)

Proof of Theorem dvhvadd Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvhvadd.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		dvhvadd.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
3		dvhvadd.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
4		dvhvadd.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		dvhvadd.f	. . . 4 ⊢ 𝐷 = (Scalar‘𝑈)
6		dvhvadd.p	. . . 4 ⊢ ⨣ = (+_g‘𝐷)
7		eqid 2760	. . . 4 ⊢ (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), ((2^nd ‘𝑓) ⨣ (2^nd ‘𝑔))⟩) = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), ((2^nd ‘𝑓) ⨣ (2^nd ‘𝑔))⟩)
8		dvhvadd.s	. . . 4 ⊢ + = (+_g‘𝑈)
9	1, 2, 3, 4, 5, 6, 7, 8	dvhfvadd 42257	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → + = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), ((2^nd ‘𝑓) ⨣ (2^nd ‘𝑔))⟩))
10	9	oveqd 7441	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 + 𝐺) = (𝐹(𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), ((2^nd ‘𝑓) ⨣ (2^nd ‘𝑔))⟩)𝐺))
11	7	dvhvaddval 42256	. 2 ⊢ ((𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸)) → (𝐹(𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ ⟨((1^st ‘𝑓) ∘ (1^st ‘𝑔)), ((2^nd ‘𝑓) ⨣ (2^nd ‘𝑔))⟩)𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)
12	10, 11	sylan9eq 2815	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⟨cop 4834 × cxp 5649 ∘ ccom 5655 ‘cfv 6543 (class class class)co 7424 ∈ cmpo 7426 1^st c1st 8003 2^nd c2nd 8004 +_gcplusg 17437 Scalarcsca 17440 HLchlt 40516 LHypclh 41150 LTrncltrn 41267 TEndoctendo 41918 DVecHcdvh 42244

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-fin 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-5 12415 df-6 12416 df-n0 12614 df-z 12701 df-uz 12973 df-fz 13647 df-struct 17334 df-slot 17369 df-ndx 17381 df-base 17397 df-plusg 17450 df-mulr 17451 df-sca 17453 df-vsca 17454 df-edring 41923 df-dvech 42245

This theorem is used by: dvhopvadd 42259 dvhvaddcl 42261 dvhvaddcomN 42262 dvhvaddass 42263 dvhlveclem 42274 diblss 42336 dicvaddcl 42356

W3C validator