| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lsppratlem5 | Structured version Visualization version GIF version | ||
| Description: Lemma for lspprat 21143. 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 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑊 ∈ LVec) |
| 6 | lspprat.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ∈ 𝑆) |
| 8 | lspprat.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 9 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑋 ∈ 𝑉) |
| 10 | lspprat.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑌 ∈ 𝑉) |
| 12 | lspprat.p | . . . . 5 ⊢ (𝜑 → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) | |
| 13 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 14 | lsppratlem1.o | . . . 4 ⊢ 0 = (0g‘𝑊) | |
| 15 | lsppratlem1.x2 | . . . . 5 ⊢ (𝜑 → 𝑥 ∈ (𝑈 ∖ { 0 })) | |
| 16 | 15 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 17 | lsppratlem1.y2 | . . . . 5 ⊢ (𝜑 → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) | |
| 18 | 17 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 19 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → 𝑥 ∈ (𝑁‘{𝑌})) | |
| 20 | 1, 2, 3, 5, 7, 9, 11, 13, 14, 16, 18, 19 | lsppratlem3 21139 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑁‘{𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 21 | 4 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑊 ∈ LVec) |
| 22 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ∈ 𝑆) |
| 23 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ 𝑉) |
| 24 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑌 ∈ 𝑉) |
| 25 | 12 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 26 | 15 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 27 | 17 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 28 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) | |
| 29 | 1, 2, 3, 21, 22, 23, 24, 25, 14, 26, 27, 28 | lsppratlem4 21140 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝑁‘{𝑥, 𝑌})) → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 30 | 1, 2, 3, 4, 6, 8, 10, 12, 14, 15, 17 | lsppratlem1 21137 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (𝑁‘{𝑌}) ∨ 𝑋 ∈ (𝑁‘{𝑥, 𝑌}))) |
| 31 | 20, 29, 30 | mpjaodan 961 | . 2 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) |
| 32 | 4 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑊 ∈ LVec) |
| 33 | 6 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ∈ 𝑆) |
| 34 | 8 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ 𝑉) |
| 35 | 10 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ 𝑉) |
| 36 | 12 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑈 ⊊ (𝑁‘{𝑋, 𝑌})) |
| 37 | 15 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑥 ∈ (𝑈 ∖ { 0 })) |
| 38 | 17 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑦 ∈ (𝑈 ∖ (𝑁‘{𝑥}))) |
| 39 | simprl 771 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑋 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 40 | simprr 773 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → 𝑌 ∈ (𝑁‘{𝑥, 𝑦})) | |
| 41 | 1, 2, 3, 32, 33, 34, 35, 36, 14, 37, 38, 39, 40 | lsppratlem2 21138 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ (𝑁‘{𝑥, 𝑦}) ∧ 𝑌 ∈ (𝑁‘{𝑥, 𝑦}))) → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| 42 | 31, 41 | mpdan 688 | 1 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑌}) ⊆ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 ⊆ wss 3890 ⊊ wpss 3891 {csn 4568 {cpr 4570 ‘cfv 6492 Basecbs 17170 0gc0g 17393 LSubSpclss 20917 LSpanclspn 20957 LVecclvec 21089 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| 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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-tpos 8169 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-oppr 20308 df-dvdsr 20328 df-unit 20329 df-invr 20359 df-drng 20699 df-lmod 20848 df-lss 20918 df-lsp 20958 df-lvec 21090 |
| This theorem is referenced by: lsppratlem6 21142 |
| Copyright terms: Public domain | W3C validator |