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 39110

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 483	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		xp1st 7863	. . . . 5 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (1^st ‘𝐹) ∈ 𝑇)
3	2	ad2antrl 725	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐹) ∈ 𝑇)
4		xp1st 7863	. . . . 5 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (1^st ‘𝐺) ∈ 𝑇)
5	4	ad2antll 726	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (1^st ‘𝐺) ∈ 𝑇)
6		dvhvaddcl.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
7		dvhvaddcl.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	6, 7	ltrncom 38752	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (1^st ‘𝐹) ∈ 𝑇 ∧ (1^st ‘𝐺) ∈ 𝑇) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
9	1, 3, 5, 8	syl3anc 1370	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((1^st ‘𝐹) ∘ (1^st ‘𝐺)) = ((1^st ‘𝐺) ∘ (1^st ‘𝐹)))
10		xp2nd 7864	. . . . . 6 ⊢ (𝐹 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐹) ∈ 𝐸)
11		xp2nd 7864	. . . . . 6 ⊢ (𝐺 ∈ (𝑇 × 𝐸) → (2^nd ‘𝐺) ∈ 𝐸)
12	10, 11	anim12i 613	. . . . 5 ⊢ ((𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸)) → ((2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸))
13		dvhvaddcl.e	. . . . . . 7 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
14		eqid 2738	. . . . . . 7 ⊢ (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))) = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))
15	6, 7, 13, 14	tendoplcom 38796	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (2^nd ‘𝐹) ∈ 𝐸 ∧ (2^nd ‘𝐺) ∈ 𝐸) → ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
16	15	3expb 1119	. . . . 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 39098	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
22	21	adantr 481	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ⨣ = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐)))))
23	22	oveqd 7292	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐹)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐺)))
24	22	oveqd 7292	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)) = ((2^nd ‘𝐺)(𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑐 ∈ 𝑇 ↦ ((𝑎‘𝑐) ∘ (𝑏‘𝑐))))(2^nd ‘𝐹)))
25	17, 23, 24	3eqtr4d 2788	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺)) = ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹)))
26	9, 25	opeq12d 4812	. 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 39106	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = ⟨((1^st ‘𝐹) ∘ (1^st ‘𝐺)), ((2^nd ‘𝐹) ⨣ (2^nd ‘𝐺))⟩)
29	6, 7, 13, 18, 19, 27, 20	dvhvadd 39106	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐺 ∈ (𝑇 × 𝐸) ∧ 𝐹 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
30	29	ancom2s 647	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐺 + 𝐹) = ⟨((1^st ‘𝐺) ∘ (1^st ‘𝐹)), ((2^nd ‘𝐺) ⨣ (2^nd ‘𝐹))⟩)
31	26, 28, 30	3eqtr4d 2788	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ (𝑇 × 𝐸) ∧ 𝐺 ∈ (𝑇 × 𝐸))) → (𝐹 + 𝐺) = (𝐺 + 𝐹))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ⟨cop 4567 ↦ cmpt 5157 × cxp 5587 ∘ ccom 5593 ‘cfv 6433 (class class class)co 7275 ∈ cmpo 7277 1^st c1st 7829 2^nd c2nd 7830 +_gcplusg 16962 Scalarcsca 16965 HLchlt 37364 LHypclh 37998 LTrncltrn 38115 TEndoctendo 38766 DVecHcdvh 39092

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-riotaBAD 36967

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-undef 8089 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-n0 12234 df-z 12320 df-uz 12583 df-fz 13240 df-struct 16848 df-slot 16883 df-ndx 16895 df-base 16913 df-plusg 16975 df-mulr 16976 df-sca 16978 df-vsca 16979 df-proset 18013 df-poset 18031 df-plt 18048 df-lub 18064 df-glb 18065 df-join 18066 df-meet 18067 df-p0 18143 df-p1 18144 df-lat 18150 df-clat 18217 df-oposet 37190 df-ol 37192 df-oml 37193 df-covers 37280 df-ats 37281 df-atl 37312 df-cvlat 37336 df-hlat 37365 df-llines 37512 df-lplanes 37513 df-lvols 37514 df-lines 37515 df-psubsp 37517 df-pmap 37518 df-padd 37810 df-lhyp 38002 df-laut 38003 df-ldil 38118 df-ltrn 38119 df-trl 38173 df-tendo 38769 df-edring 38771 df-dvech 39093

This theorem is referenced by: (None)

W3C validator