| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsppratlem5 | Structured version Visualization version GIF version | ||
| Description: Lemma for lspprat 21211. Combine the two cases and show a contradiction to 𝑈 ⊊ (𝑁‘{𝑋, 𝑌}) under the assumptions on 𝑥 and 𝑦. (Contributed by NM, 29-Aug-2014.) |
| Ref | Expression |
|---|---|
| lspprat.v | ⊢ 𝑉 = (Base‘𝑊) |
| lspprat.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lspprat.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lspprat.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lspprat.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| lspprat.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lspprat.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lspprat.p | ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| lsppratlem1.o | ⊢ 0 = (0g‘𝑊) |
| lsppratlem1.x2 | ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| lsppratlem1.y2 | ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| Ref | Expression |
|---|---|
| lsppratlem5 | ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lspprat.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | lspprat.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 3 | lspprat.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 4 | lspprat.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 5 | 4 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑊 ∈ LVec) |
| 6 | lspprat.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 7 | 6 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ∈ 𝑆) |
| 8 | lspprat.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 9 | 8 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑋 ∈ 𝑉) |
| 10 | lspprat.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | 10 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑌 ∈ 𝑉) |
| 12 | lspprat.p | . . . . 5 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) | |
| 13 | 12 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 14 | lsppratlem1.o | . . . 4 ⊢ 0 = (0g‘𝑊) | |
| 15 | lsppratlem1.x2 | . . . . 5 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) | |
| 16 | 15 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 17 | lsppratlem1.y2 | . . . . 5 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) | |
| 18 | 17 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 19 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑁‘{𝑌})) | |
| 20 | 1, 2, 3, 5, 7, 9, 11, 13, 14, 16, 18, 19 | lsppratlem3 21207 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 21 | 4 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑊 ∈ LVec) |
| 22 | 6 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ∈ 𝑆) |
| 23 | 8 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ 𝑉) |
| 24 | 10 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑌 ∈ 𝑉) |
| 25 | 12 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 26 | 15 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 27 | 17 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 28 | simpr 488 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) | |
| 29 | 1, 2, 3, 21, 22, 23, 24, 25, 14, 26, 27, 28 | lsppratlem4 21208 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 30 | 1, 2, 3, 4, 6, 8, 10, 12, 14, 15, 17 | lsppratlem1 21205 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑁‘{𝑌}) ∨ 𝑋 ∈ (𝑁‘{𝑥, 𝑌}))) |
| 31 | 20, 29, 30 | mpjaodan 971 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 32 | 4 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑊 ∈ LVec) |
| 33 | 6 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ∈ 𝑆) |
| 34 | 8 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ 𝑉) |
| 35 | 10 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ 𝑉) |
| 36 | 12 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 37 | 15 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 38 | 17 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 39 | simprl 780 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 40 | simprr 782 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 41 | 1, 2, 3, 32, 33, 34, 35, 36, 14, 37, 38, 39, 40 | lsppratlem2 21206 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| 42 | 31, 41 | mpdan 697 | 1 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∖ cdif 3899 ⊆ wss 3902 ⊊ wpss 3903 {csn 4579 {cpr 4581 ‘cfv 6516 Basecbs 17236 0gc0g 17459 LSubSpclss 20986 LSpanclspn 21026 LVecclvec 21157 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-tpos 8200 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-mulr 17291 df-0g 17461 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-grp 18969 df-minusg 18970 df-sbg 18971 df-cmn 19813 df-abl 19814 df-mgp 20178 df-rng 20190 df-ur 20219 df-ring 20272 df-oppr 20373 df-dvdsr 20393 df-unit 20394 df-invr 20424 df-drng 20768 df-lmod 20917 df-lss 20987 df-lsp 21027 df-lvec 21158 |
| This theorem is referenced by: lsppratlem6 21210 |
| Copyright terms: Public domain | W3C validator |