mapdindp2 - Mathbox for Norm Megill

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

Theorem mapdindp2 41991

Description: Vector independence lemma. (Contributed by NM, 1-May-2015.)

**Hypotheses**
Ref	Expression
mapdindp1.v	⊢ 𝑉 = (Base‘𝑊)
mapdindp1.p	⊢ + = (+_g‘𝑊)
mapdindp1.o	⊢ 0 = (0_g‘𝑊)
mapdindp1.n	⊢ 𝑁 = (LSpan‘𝑊)
mapdindp1.w	⊢ (𝜑 → 𝑊 ∈ LVec)
mapdindp1.x	⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
mapdindp1.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
mapdindp1.z	⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
mapdindp1.W	⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 }))
mapdindp1.e	⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
mapdindp1.ne	⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
mapdindp1.f	⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))

**Assertion**
Ref	Expression
mapdindp2	⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, (𝑌 + 𝑍)}))

**Proof of Theorem mapdindp2**
Step	Hyp	Ref	Expression
1		preq2 4691	. . . . . 6 ⊢ ((𝑌 + 𝑍) = 0 → {𝑋, (𝑌 + 𝑍)} = {𝑋, 0 })
2	1	fveq2d 6838	. . . . 5 ⊢ ((𝑌 + 𝑍) = 0 → (𝑁‘{𝑋, (𝑌 + 𝑍)}) = (𝑁‘{𝑋, 0 }))
3		mapdindp1.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
4		mapdindp1.o	. . . . . 6 ⊢ 0 = (0_g‘𝑊)
5		mapdindp1.n	. . . . . 6 ⊢ 𝑁 = (LSpan‘𝑊)
6		mapdindp1.w	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LVec)
7		lveclmod 21058	. . . . . . 7 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
8	6, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ LMod)
9		mapdindp1.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
10	9	eldifad 3913	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
11	3, 4, 5, 8, 10	lsppr0 21044	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋, 0 }) = (𝑁‘{𝑋}))
12	2, 11	sylan9eqr 2793	. . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{𝑋, (𝑌 + 𝑍)}) = (𝑁‘{𝑋}))
13		mapdindp1.y	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
14	13	eldifad 3913	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
15		prssi 4777	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {𝑋, 𝑌} ⊆ 𝑉)
16	10, 14, 15	syl2anc 584	. . . . . 6 ⊢ (𝜑 → {𝑋, 𝑌} ⊆ 𝑉)
17		snsspr1 4770	. . . . . . 7 ⊢ {𝑋} ⊆ {𝑋, 𝑌}
18	17	a1i 11	. . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ {𝑋, 𝑌})
19	3, 5	lspss 20935	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ {𝑋, 𝑌} ⊆ 𝑉 ∧ {𝑋} ⊆ {𝑋, 𝑌}) → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}))
20	8, 16, 18, 19	syl3anc 1373	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}))
21	20	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑋, 𝑌}))
22	12, 21	eqsstrd 3968	. . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{𝑋, (𝑌 + 𝑍)}) ⊆ (𝑁‘{𝑋, 𝑌}))
23		mapdindp1.f	. . . 4 ⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
24	23	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
25	22, 24	ssneldd 3936	. 2 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → ¬ 𝑤 ∈ (𝑁‘{𝑋, (𝑌 + 𝑍)}))
26	23	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
27		mapdindp1.p	. . . . . 6 ⊢ + = (+_g‘𝑊)
28	6	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑊 ∈ LVec)
29	9	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑋 ∈ (𝑉 ∖ { 0 }))
30	13	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑌 ∈ (𝑉 ∖ { 0 }))
31		mapdindp1.z	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
32	31	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑍 ∈ (𝑉 ∖ { 0 }))
33		mapdindp1.W	. . . . . . 7 ⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 }))
34	33	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑤 ∈ (𝑉 ∖ { 0 }))
35		mapdindp1.e	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
36	35	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
37		mapdindp1.ne	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
38	37	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
39		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑌 + 𝑍) ≠ 0 )
40	3, 27, 4, 5, 28, 29, 30, 32, 34, 36, 38, 26, 39	mapdindp0 41989	. . . . 5 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{(𝑌 + 𝑍)}) = (𝑁‘{𝑌}))
41	40	oveq2d 7374	. . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑌 + 𝑍)})) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
42		eqid 2736	. . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊)
43	31	eldifad 3913	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
44	3, 27	lmodvacl 20826	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑉) → (𝑌 + 𝑍) ∈ 𝑉)
45	8, 14, 43, 44	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ 𝑉)
46	3, 5, 42, 8, 10, 45	lsmpr 21041	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋, (𝑌 + 𝑍)}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑌 + 𝑍)})))
47	46	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋, (𝑌 + 𝑍)}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{(𝑌 + 𝑍)})))
48	3, 5, 42, 8, 10, 14	lsmpr 21041	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
49	48	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋, 𝑌}) = ((𝑁‘{𝑋})(LSSum‘𝑊)(𝑁‘{𝑌})))
50	41, 47, 49	3eqtr4d 2781	. . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋, (𝑌 + 𝑍)}) = (𝑁‘{𝑋, 𝑌}))
51	26, 50	neleqtrrd 2859	. 2 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → ¬ 𝑤 ∈ (𝑁‘{𝑋, (𝑌 + 𝑍)}))
52	25, 51	pm2.61dane 3019	1 ⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, (𝑌 + 𝑍)}))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∖ cdif 3898 ⊆ wss 3901 {csn 4580 {cpr 4582 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +_gcplusg 17177 0_gc0g 17359 LSSumclsm 19563 LModclmod 20811 LSpanclspn 20922 LVecclvec 21054

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19053 df-cntz 19246 df-lsm 19565 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-oppr 20273 df-dvdsr 20293 df-unit 20294 df-invr 20324 df-drng 20664 df-lmod 20813 df-lss 20883 df-lsp 20923 df-lvec 21055

This theorem is referenced by: mapdh6dN 42009 hdmap1l6d 42083

W3C validator