mapdindp4 - Mathbox for Norm Megill

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

Theorem mapdindp4 41725

Description: Vector independence lemma. (Contributed by NM, 29-Apr-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
mapdindp4	⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, (𝑤 + 𝑌)}))

**Proof of Theorem mapdindp4**
Step	Hyp	Ref	Expression
1		mapdindp1.v	. . 3 ⊢ 𝑉 = (Base‘𝑊)
2		mapdindp1.o	. . 3 ⊢ 0 = (0_g‘𝑊)
3		mapdindp1.n	. . 3 ⊢ 𝑁 = (LSpan‘𝑊)
4		mapdindp1.w	. . 3 ⊢ (𝜑 → 𝑊 ∈ LVec)
5		mapdindp1.z	. . 3 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 }))
6		lveclmod 21105	. . . . 5 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod)
7	4, 6	syl 17	. . . 4 ⊢ (𝜑 → 𝑊 ∈ LMod)
8		mapdindp1.W	. . . . 5 ⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 }))
9	8	eldifad 3963	. . . 4 ⊢ (𝜑 → 𝑤 ∈ 𝑉)
10		mapdindp1.y	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))
11	10	eldifad 3963	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
12		mapdindp1.p	. . . . 5 ⊢ + = (+_g‘𝑊)
13	1, 12	lmodvacl 20873	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑤 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑤 + 𝑌) ∈ 𝑉)
14	7, 9, 11, 13	syl3anc 1373	. . 3 ⊢ (𝜑 → (𝑤 + 𝑌) ∈ 𝑉)
15		mapdindp1.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
16	15	eldifad 3963	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
17		mapdindp1.e	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))
18		mapdindp1.f	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))
19	1, 3, 4, 9, 16, 11, 18	lspindpi 21134	. . . . . . . 8 ⊢ (𝜑 → ((𝑁‘{𝑤}) ≠ (𝑁‘{𝑋}) ∧ (𝑁‘{𝑤}) ≠ (𝑁‘{𝑌})))
20	19	simprd 495	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑌}))
21	20	necomd 2996	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))
22	1, 12, 2, 3, 4, 11, 8, 21	lspindp3 21138	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{(𝑌 + 𝑤)}))
23	1, 12	lmodcom 20906	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑤 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑤 + 𝑌) = (𝑌 + 𝑤))
24	7, 9, 11, 23	syl3anc 1373	. . . . . . 7 ⊢ (𝜑 → (𝑤 + 𝑌) = (𝑌 + 𝑤))
25	24	sneqd 4638	. . . . . 6 ⊢ (𝜑 → {(𝑤 + 𝑌)} = {(𝑌 + 𝑤)})
26	25	fveq2d 6910	. . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑤 + 𝑌)}) = (𝑁‘{(𝑌 + 𝑤)}))
27	22, 26	neeqtrrd 3015	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{(𝑤 + 𝑌)}))
28	17, 27	eqnetrrd 3009	. . 3 ⊢ (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{(𝑤 + 𝑌)}))
29		mapdindp1.ne	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))
30	1, 2, 3, 4, 15, 11, 9, 29, 18	lspindp1 21135	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑤}) ≠ (𝑁‘{𝑌}) ∧ ¬ 𝑋 ∈ (𝑁‘{𝑤, 𝑌})))
31	30	simprd 495	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑤, 𝑌}))
32		eqid 2737	. . . . . 6 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊)
33	5	eldifad 3963	. . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉)
34	1, 3, 32, 7, 33, 14	lsmpr 21088	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑍, (𝑤 + 𝑌)}) = ((𝑁‘{𝑍})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})))
35	1, 12	lmodcom 20906	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ 𝑉 ∧ 𝑤 ∈ 𝑉) → (𝑌 + 𝑤) = (𝑤 + 𝑌))
36	7, 11, 9, 35	syl3anc 1373	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 + 𝑤) = (𝑤 + 𝑌))
37	36	preq2d 4740	. . . . . . . 8 ⊢ (𝜑 → {𝑌, (𝑌 + 𝑤)} = {𝑌, (𝑤 + 𝑌)})
38	37	fveq2d 6910	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌, (𝑌 + 𝑤)}) = (𝑁‘{𝑌, (𝑤 + 𝑌)}))
39	1, 12, 3, 7, 11, 9	lspprabs 21094	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌, (𝑌 + 𝑤)}) = (𝑁‘{𝑌, 𝑤}))
40	1, 3, 32, 7, 11, 14	lsmpr 21088	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑌, (𝑤 + 𝑌)}) = ((𝑁‘{𝑌})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})))
41	38, 39, 40	3eqtr3rd 2786	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑌})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})) = (𝑁‘{𝑌, 𝑤}))
42	17	oveq1d 7446	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑌})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})) = ((𝑁‘{𝑍})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})))
43		prcom 4732	. . . . . . . 8 ⊢ {𝑌, 𝑤} = {𝑤, 𝑌}
44	43	fveq2i 6909	. . . . . . 7 ⊢ (𝑁‘{𝑌, 𝑤}) = (𝑁‘{𝑤, 𝑌})
45	44	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌, 𝑤}) = (𝑁‘{𝑤, 𝑌}))
46	41, 42, 45	3eqtr3d 2785	. . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑍})(LSSum‘𝑊)(𝑁‘{(𝑤 + 𝑌)})) = (𝑁‘{𝑤, 𝑌}))
47	34, 46	eqtrd 2777	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑍, (𝑤 + 𝑌)}) = (𝑁‘{𝑤, 𝑌}))
48	31, 47	neleqtrrd 2864	. . 3 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑍, (𝑤 + 𝑌)}))
49	1, 2, 3, 4, 5, 14, 16, 28, 48	lspindp1 21135	. 2 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{(𝑤 + 𝑌)}) ∧ ¬ 𝑍 ∈ (𝑁‘{𝑋, (𝑤 + 𝑌)})))
50	49	simprd 495	1 ⊢ (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, (𝑤 + 𝑌)}))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 = wceq 1540 ∈ wcel 2108 ≠ wne 2940 ∖ cdif 3948 {csn 4626 {cpr 4628 ‘cfv 6561 (class class class)co 7431 Basecbs 17247 +_gcplusg 17297 0_gc0g 17484 LSSumclsm 19652 LModclmod 20858 LSpanclspn 20969 LVecclvec 21101

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

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-op 4633 df-uni 4908 df-int 4947 df-iun 4993 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-tpos 8251 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 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-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-mulr 17311 df-0g 17486 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-submnd 18797 df-grp 18954 df-minusg 18955 df-sbg 18956 df-subg 19141 df-cntz 19335 df-lsm 19654 df-cmn 19800 df-abl 19801 df-mgp 20138 df-rng 20150 df-ur 20179 df-ring 20232 df-oppr 20334 df-dvdsr 20357 df-unit 20358 df-invr 20388 df-drng 20731 df-lmod 20860 df-lss 20930 df-lsp 20970 df-lvec 21102

This theorem is referenced by: mapdh6eN 41742 hdmap1l6e 41816

W3C validator