Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdindp1 | Structured version Visualization version GIF version |
Description: Vector independence lemma. (Contributed by NM, 1-May-2015.) |
Ref | Expression |
---|---|
mapdindp1.v | ⊢ 𝑉 = (Base‘𝑊) |
mapdindp1.p | ⊢ + = (+g‘𝑊) |
mapdindp1.o | ⊢ 0 = (0g‘𝑊) |
mapdindp1.n | ⊢ 𝑁 = (LSpan‘𝑊) |
mapdindp1.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
mapdindp1.x | ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) |
mapdindp1.y | ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) |
mapdindp1.z | ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 })) |
mapdindp1.W | ⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 })) |
mapdindp1.e | ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍})) |
mapdindp1.ne | ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
mapdindp1.f | ⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) |
Ref | Expression |
---|---|
mapdindp1 | ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mapdindp1.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) | |
2 | eldifsni 4724 | . . . . . 6 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → 𝑋 ≠ 0 ) | |
3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑋 ≠ 0 ) |
4 | mapdindp1.w | . . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
5 | lveclmod 19880 | . . . . . . . . . 10 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
6 | 4, 5 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ LMod) |
7 | mapdindp1.o | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑊) | |
8 | mapdindp1.n | . . . . . . . . . 10 ⊢ 𝑁 = (LSpan‘𝑊) | |
9 | 7, 8 | lspsn0 19782 | . . . . . . . . 9 ⊢ (𝑊 ∈ LMod → (𝑁‘{ 0 }) = { 0 }) |
10 | 6, 9 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → (𝑁‘{ 0 }) = { 0 }) |
11 | 10 | eqeq2d 2834 | . . . . . . 7 ⊢ (𝜑 → ((𝑁‘{𝑋}) = (𝑁‘{ 0 }) ↔ (𝑁‘{𝑋}) = { 0 })) |
12 | 1 | eldifad 3950 | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
13 | mapdindp1.v | . . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑊) | |
14 | 13, 7, 8 | lspsneq0 19786 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
15 | 6, 12, 14 | syl2anc 586 | . . . . . . 7 ⊢ (𝜑 → ((𝑁‘{𝑋}) = { 0 } ↔ 𝑋 = 0 )) |
16 | 11, 15 | bitrd 281 | . . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) = (𝑁‘{ 0 }) ↔ 𝑋 = 0 )) |
17 | 16 | necon3bid 3062 | . . . . 5 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{ 0 }) ↔ 𝑋 ≠ 0 )) |
18 | 3, 17 | mpbird 259 | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{ 0 })) |
19 | 18 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{ 0 })) |
20 | sneq 4579 | . . . . 5 ⊢ ((𝑌 + 𝑍) = 0 → {(𝑌 + 𝑍)} = { 0 }) | |
21 | 20 | fveq2d 6676 | . . . 4 ⊢ ((𝑌 + 𝑍) = 0 → (𝑁‘{(𝑌 + 𝑍)}) = (𝑁‘{ 0 })) |
22 | 21 | adantl 484 | . . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{(𝑌 + 𝑍)}) = (𝑁‘{ 0 })) |
23 | 19, 22 | neeqtrrd 3092 | . 2 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) = 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)})) |
24 | mapdindp1.ne | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) | |
25 | 24 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
26 | mapdindp1.p | . . . 4 ⊢ + = (+g‘𝑊) | |
27 | 4 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑊 ∈ LVec) |
28 | 1 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑋 ∈ (𝑉 ∖ { 0 })) |
29 | mapdindp1.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) | |
30 | 29 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑌 ∈ (𝑉 ∖ { 0 })) |
31 | mapdindp1.z | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 })) | |
32 | 31 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑍 ∈ (𝑉 ∖ { 0 })) |
33 | mapdindp1.W | . . . . 5 ⊢ (𝜑 → 𝑤 ∈ (𝑉 ∖ { 0 })) | |
34 | 33 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → 𝑤 ∈ (𝑉 ∖ { 0 })) |
35 | mapdindp1.e | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍})) | |
36 | 35 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑌}) = (𝑁‘{𝑍})) |
37 | mapdindp1.f | . . . . 5 ⊢ (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) | |
38 | 37 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌})) |
39 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑌 + 𝑍) ≠ 0 ) | |
40 | 13, 26, 7, 8, 27, 28, 30, 32, 34, 36, 25, 38, 39 | mapdindp0 38857 | . . 3 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{(𝑌 + 𝑍)}) = (𝑁‘{𝑌})) |
41 | 25, 40 | neeqtrrd 3092 | . 2 ⊢ ((𝜑 ∧ (𝑌 + 𝑍) ≠ 0 ) → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)})) |
42 | 23, 41 | pm2.61dane 3106 | 1 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)})) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∖ cdif 3935 {csn 4569 {cpr 4571 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 +gcplusg 16567 0gc0g 16715 LModclmod 19636 LSpanclspn 19745 LVecclvec 19876 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-tpos 7894 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-0g 16717 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-submnd 17959 df-grp 18108 df-minusg 18109 df-sbg 18110 df-subg 18278 df-cntz 18449 df-lsm 18763 df-cmn 18910 df-abl 18911 df-mgp 19242 df-ur 19254 df-ring 19301 df-oppr 19375 df-dvdsr 19393 df-unit 19394 df-invr 19424 df-drng 19506 df-lmod 19638 df-lss 19706 df-lsp 19746 df-lvec 19877 |
This theorem is referenced by: mapdh6dN 38877 mapdh6hN 38881 hdmap1l6d 38951 hdmap1l6h 38955 |
Copyright terms: Public domain | W3C validator |