dvhvaddcomN - Mathbox for Norm Megill

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

Theorem dvhvaddcomN 38392

Description: Commutativity of vector sum. (Contributed by NM, 26-Oct-2013.) (Revised by Mario Carneiro, 23-Jun-2014.) (New usage is discouraged.)

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

**Assertion**
Ref	Expression
dvhvaddcomN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = (𝐺 + 𝐹))

Proof of Theorem dvhvaddcomN Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 486	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		xp1st 7703	. . . . 5 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (1^st ‘𝐹) ∈ 𝑇)
3	2	ad2antrl 727	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐹) ∈ 𝑇)
4		xp1st 7703	. . . . 5 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (1^st ‘𝐺) ∈ 𝑇)
5	4	ad2antll 728	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐺) ∈ 𝑇)
6		dvhvaddcl.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
7		dvhvaddcl.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	6, 7	ltrncom 38034	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (1^st ‘𝐹) ∈ 𝑇 ∧ (1^st ‘𝐺) ∈ 𝑇) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
9	1, 3, 5, 8	syl3anc 1368	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
10		xp2nd 7704	. . . . . 6 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐹) ∈ 𝐸)
11		xp2nd 7704	. . . . . 6 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐺) ∈ 𝐸)
12	10, 11	anim12i 615	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸)) → ((2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸))
13		dvhvaddcl.e	. . . . . . 7 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
14		eqid 2798	. . . . . . 7 ⊢ (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))) = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))
15	6, 7, 13, 14	tendoplcom 38078	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
16	15	3expb 1117	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸)) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
17	12, 16	sylan2 595	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
18		dvhvaddcl.u	. . . . . . 7 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
19		dvhvaddcl.d	. . . . . . 7 ⊢ 𝐷 = (Scalar‘𝑈)
20		dvhvaddcl.p	. . . . . . 7 ⊢ ⨣ = (+_g‘𝐷)
21	6, 7, 13, 18, 19, 14, 20	dvhfplusr 38380	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
22	21	adantr 484	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
23	22	oveqd 7152	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)))
24	22	oveqd 7152	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
25	17, 23, 24	3eqtr4d 2843	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)))
26	9, 25	opeq12d 4773	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩ = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
27		dvhvaddcl.a	. . 3 ⊢ + = (+_g‘𝑈)
28	6, 7, 13, 18, 19, 27, 20	dvhvadd 38388	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)
29	6, 7, 13, 18, 19, 27, 20	dvhvadd 38388	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∈ (𝑇 × 𝐸) ∧ 𝐹 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
30	29	ancom2s 649	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
31	26, 28, 30	3eqtr4d 2843	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = (𝐺 + 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ⟨cop 4531 ↦ cmpt 5110 × cxp 5517 ∘ ccom 5523 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 1^st c1st 7669 2^nd c2nd 7670 +_gcplusg 16557 Scalarcsca 16560 HLchlt 36646 LHypclh 37280 LTrncltrn 37397 TEndoctendo 38048 DVecHcdvh 38374

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-riotaBAD 36249

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-undef 7922 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-plusg 16570 df-mulr 16571 df-sca 16573 df-vsca 16574 df-proset 17530 df-poset 17548 df-plt 17560 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-p0 17641 df-p1 17642 df-lat 17648 df-clat 17710 df-oposet 36472 df-ol 36474 df-oml 36475 df-covers 36562 df-ats 36563 df-atl 36594 df-cvlat 36618 df-hlat 36647 df-llines 36794 df-lplanes 36795 df-lvols 36796 df-lines 36797 df-psubsp 36799 df-pmap 36800 df-padd 37092 df-lhyp 37284 df-laut 37285 df-ldil 37400 df-ltrn 37401 df-trl 37455 df-tendo 38051 df-edring 38053 df-dvech 38375

This theorem is referenced by: (None)

W3C validator