| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsppratlem5 | Structured version Visualization version GIF version | ||
| Description: Lemma for lspprat 21251. 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 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑊 ∈ LVec) |
| 6 | lspprat.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 7 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ∈ 𝑆) |
| 8 | lspprat.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 9 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑋 ∈ 𝑉) |
| 10 | lspprat.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑌 ∈ 𝑉) |
| 12 | lspprat.p | . . . . 5 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) | |
| 13 | 12 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 14 | lsppratlem1.o | . . . 4 ⊢ 0 = (0g‘𝑊) | |
| 15 | lsppratlem1.x2 | . . . . 5 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) | |
| 16 | 15 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 17 | lsppratlem1.y2 | . . . . 5 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) | |
| 18 | 17 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 19 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑁‘{𝑌})) | |
| 20 | 1, 2, 3, 5, 7, 9, 11, 13, 14, 16, 18, 19 | lsppratlem3 21247 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 21 | 4 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑊 ∈ LVec) |
| 22 | 6 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ∈ 𝑆) |
| 23 | 8 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ 𝑉) |
| 24 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑌 ∈ 𝑉) |
| 25 | 12 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 26 | 15 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 27 | 17 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 28 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) | |
| 29 | 1, 2, 3, 21, 22, 23, 24, 25, 14, 26, 27, 28 | lsppratlem4 21248 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 30 | 1, 2, 3, 4, 6, 8, 10, 12, 14, 15, 17 | lsppratlem1 21245 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑁‘{𝑌}) ∨ 𝑋 ∈ (𝑁‘{𝑥, 𝑌}))) |
| 31 | 20, 29, 30 | mpjaodan 973 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 32 | 4 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑊 ∈ LVec) |
| 33 | 6 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ∈ 𝑆) |
| 34 | 8 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ 𝑉) |
| 35 | 10 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ 𝑉) |
| 36 | 12 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 37 | 15 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 38 | 17 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 39 | simprl 782 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 40 | simprr 784 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 41 | 1, 2, 3, 32, 33, 34, 35, 36, 14, 37, 38, 39, 40 | lsppratlem2 21246 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| 42 | 31, 41 | mpdan 699 | 1 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∖ cdif 3910 ⊆ wss 3913 ⊊ wpss 3914 {csn 4591 {cpr 4593 ‘cfv 6533 Basecbs 17265 0gc0g 17488 LSubSpclss 21026 LSpanclspn 21066 LVecclvec 21197 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-tpos 8218 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-2 12299 df-3 12300 df-sets 17220 df-slot 17238 df-ndx 17250 df-base 17266 df-ress 17287 df-plusg 17319 df-mulr 17320 df-0g 17490 df-mgm 18694 df-sgrp 18773 df-mnd 18789 df-grp 18999 df-minusg 19000 df-sbg 19001 df-cmn 19848 df-abl 19849 df-mgp 20213 df-rng 20227 df-ur 20260 df-ring 20313 df-oppr 20415 df-dvdsr 20435 df-unit 20436 df-invr 20466 df-drng 20811 df-lmod 20957 df-lss 21027 df-lsp 21067 df-lvec 21198 |
| This theorem is referenced by: lsppratlem6 21250 |
| Copyright terms: Public domain | W3C validator |