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 41098

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 482	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		xp1st 8046	. . . . 5 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (1^st ‘𝐹) ∈ 𝑇)
3	2	ad2antrl 728	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐹) ∈ 𝑇)
4		xp1st 8046	. . . . 5 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (1^st ‘𝐺) ∈ 𝑇)
5	4	ad2antll 729	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐺) ∈ 𝑇)
6		dvhvaddcl.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
7		dvhvaddcl.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	6, 7	ltrncom 40740	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (1^st ‘𝐹) ∈ 𝑇 ∧ (1^st ‘𝐺) ∈ 𝑇) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
9	1, 3, 5, 8	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
10		xp2nd 8047	. . . . . 6 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐹) ∈ 𝐸)
11		xp2nd 8047	. . . . . 6 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐺) ∈ 𝐸)
12	10, 11	anim12i 613	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸)) → ((2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸))
13		dvhvaddcl.e	. . . . . . 7 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
14		eqid 2737	. . . . . . 7 ⊢ (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))) = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))
15	6, 7, 13, 14	tendoplcom 40784	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
16	15	3expb 1121	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸)) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
17	12, 16	sylan2 593	. . . 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 41086	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
22	21	adantr 480	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
23	22	oveqd 7448	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)))
24	22	oveqd 7448	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
25	17, 23, 24	3eqtr4d 2787	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)))
26	9, 25	opeq12d 4881	. 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 41094	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)
29	6, 7, 13, 18, 19, 27, 20	dvhvadd 41094	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∈ (𝑇 × 𝐸) ∧ 𝐹 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
30	29	ancom2s 650	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
31	26, 28, 30	3eqtr4d 2787	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = (𝐺 + 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ⟨cop 4632 ↦ cmpt 5225 × cxp 5683 ∘ ccom 5689 ‘cfv 6561 (class class class)co 7431 ∈ cmpo 7433 1^st c1st 8012 2^nd c2nd 8013 +_gcplusg 17297 Scalarcsca 17300 HLchlt 39351 LHypclh 39986 LTrncltrn 40103 TEndoctendo 40754 DVecHcdvh 41080

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 ax-riotaBAD 38954

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-undef 8298 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-struct 17184 df-slot 17219 df-ndx 17231 df-base 17248 df-plusg 17310 df-mulr 17311 df-sca 17313 df-vsca 17314 df-proset 18340 df-poset 18359 df-plt 18375 df-lub 18391 df-glb 18392 df-join 18393 df-meet 18394 df-p0 18470 df-p1 18471 df-lat 18477 df-clat 18544 df-oposet 39177 df-ol 39179 df-oml 39180 df-covers 39267 df-ats 39268 df-atl 39299 df-cvlat 39323 df-hlat 39352 df-llines 39500 df-lplanes 39501 df-lvols 39502 df-lines 39503 df-psubsp 39505 df-pmap 39506 df-padd 39798 df-lhyp 39990 df-laut 39991 df-ldil 40106 df-ltrn 40107 df-trl 40161 df-tendo 40757 df-edring 40759 df-dvech 41081

This theorem is referenced by: (None)

W3C validator