| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lspexchn1 | Structured version Visualization version GIF version | ||
| Description: Exchange property for span of a pair with negated membership. TODO: look at uses of lspexch 21101 to see if this will shorten proofs. (Contributed by NM, 20-May-2015.) |
| Ref | Expression |
|---|---|
| lspexchn1.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspexchn1.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspexchn1.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lspexchn1.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lspexchn1.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lspexchn1.z | ⊢ (𝜑 → 𝑍 ∈ 𝑉) |
| lspexchn1.q | ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘{𝑍})) |
| lspexchn1.e | ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍})) |
| Ref | Expression |
|---|---|
| lspexchn1 | ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspexchn1.e | . 2 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍})) | |
| 2 | lspexchn1.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
| 3 | eqid 2737 | . . 3 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 4 | lspexchn1.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 5 | lspexchn1.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 6 | 5 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑊 ∈ LVec) |
| 7 | eqid 2737 | . . . . 5 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 8 | lveclmod 21075 | . . . . . 6 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 9 | 5, 8 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 10 | lspexchn1.z | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑉) | |
| 11 | 2, 7, 4 | lspsncl 20945 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑍 ∈ 𝑉) → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑊)) |
| 12 | 9, 10, 11 | syl2anc 585 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑍}) ∈ (LSubSp‘𝑊)) |
| 13 | lspexchn1.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 14 | lspexchn1.q | . . . . 5 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘{𝑍})) | |
| 15 | 3, 7, 9, 12, 13, 14 | lssneln0 20921 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ {(0g‘𝑊)})) |
| 16 | 15 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑌 ∈ (𝑉 ∖ {(0g‘𝑊)})) |
| 17 | lspexchn1.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 18 | 17 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑋 ∈ 𝑉) |
| 19 | 10 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑍 ∈ 𝑉) |
| 20 | 2, 4, 9, 13, 10, 14 | lspsnne2 21090 | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) |
| 21 | 20 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) |
| 22 | simpr 484 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) | |
| 23 | 2, 3, 4, 6, 16, 18, 19, 21, 22 | lspexch 21101 | . 2 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) → 𝑋 ∈ (𝑁‘{𝑌, 𝑍})) |
| 24 | 1, 23 | mtand 816 | 1 ⊢ (𝜑 → ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍})) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3900 {csn 4582 {cpr 4584 ‘cfv 6502 Basecbs 17150 0gc0g 17373 LModclmod 20828 LSubSpclss 20899 LSpanclspn 20939 LVecclvec 21071 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-tpos 8180 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-mulr 17205 df-0g 17375 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-submnd 18723 df-grp 18883 df-minusg 18884 df-sbg 18885 df-subg 19070 df-cntz 19263 df-lsm 19582 df-cmn 19728 df-abl 19729 df-mgp 20093 df-rng 20105 df-ur 20134 df-ring 20187 df-oppr 20290 df-dvdsr 20310 df-unit 20311 df-invr 20341 df-drng 20681 df-lmod 20830 df-lss 20900 df-lsp 20940 df-lvec 21072 |
| This theorem is referenced by: lspexchn2 21103 |
| Copyright terms: Public domain | W3C validator |