| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lshpnel2N | Structured version Visualization version GIF version | ||
| Description: Condition that determines a hyperplane. (Contributed by NM, 3-Oct-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| lshpnel2.v | ⊢ 𝑉 = (Base‘𝑊) |
| lshpnel2.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lshpnel2.n | ⊢ 𝑁 = (LSpan‘𝑊) |
| lshpnel2.p | ⊢ ⊕ = (LSSum‘𝑊) |
| lshpnel2.h | ⊢ 𝐻 = (LSHyp‘𝑊) |
| lshpnel2.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lshpnel2.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| lshpnel2.t | ⊢ (𝜑 → 𝑈 ≠ 𝑉) |
| lshpnel2.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lshpnel2.e | ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) |
| Ref | Expression |
|---|---|
| lshpnel2N | ⊢ (𝜑 → (𝑈 ∈ 𝐻 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lshpnel2.e | . . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈) | |
| 2 | 1 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → ¬ 𝑋 ∈ 𝑈) |
| 3 | lshpnel2.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lshpnel2.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑊) | |
| 5 | lshpnel2.p | . . . 4 ⊢ ⊕ = (LSSum‘𝑊) | |
| 6 | lshpnel2.h | . . . 4 ⊢ 𝐻 = (LSHyp‘𝑊) | |
| 7 | lshpnel2.w | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 8 | 7 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑊 ∈ LVec) |
| 9 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑈 ∈ 𝐻) | |
| 10 | lshpnel2.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 11 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑋 ∈ 𝑉) |
| 12 | 3, 4, 5, 6, 8, 9, 11 | lshpnelb 39726 | . . 3 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (¬ 𝑋 ∈ 𝑈 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| 13 | 2, 12 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) |
| 14 | lshpnel2.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 15 | 14 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝑆) |
| 16 | lshpnel2.t | . . . 4 ⊢ (𝜑 → 𝑈 ≠ 𝑉) | |
| 17 | 16 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ≠ 𝑉) |
| 18 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑋 ∈ 𝑉) |
| 19 | lveclmod 21206 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 20 | 7, 19 | syl 18 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 21 | lshpnel2.s | . . . . . . . . . . 11 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 22 | 21, 4 | lspid 21082 | . . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑁‘𝑈) = 𝑈) |
| 23 | 20, 14, 22 | syl2anc 595 | . . . . . . . . 9 ⊢ (𝜑 → (𝑁‘𝑈) = 𝑈) |
| 24 | 23 | uneq1d 4120 | . . . . . . . 8 ⊢ (𝜑 → ((𝑁‘𝑈) ∪ (𝑁‘{𝑋})) = (𝑈 ∪ (𝑁‘{𝑋}))) |
| 25 | 24 | fveq2d 6885 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋}))) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 26 | 3, 21 | lssss 21036 | . . . . . . . . 9 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉) |
| 27 | 14, 26 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ⊆ 𝑉) |
| 28 | 10 | snssd 4751 | . . . . . . . 8 ⊢ (𝜑 → {𝑋} ⊆ 𝑉) |
| 29 | 3, 4 | lspun 21087 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ∧ {𝑋} ⊆ 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 30 | 20, 27, 28, 29 | syl3anc 1396 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 31 | 3, 21, 4 | lspsncl 21077 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ 𝑆) |
| 32 | 20, 10, 31 | syl2anc 595 | . . . . . . . 8 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ 𝑆) |
| 33 | 21, 4, 5 | lsmsp 21186 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑁‘{𝑋}) ∈ 𝑆) → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 34 | 20, 14, 32, 33 | syl3anc 1396 | . . . . . . 7 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 35 | 25, 30, 34 | 3eqtr4rd 2807 | . . . . . 6 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ {𝑋}))) |
| 36 | 35 | eqeq1d 2763 | . . . . 5 ⊢ (𝜑 → ((𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 37 | 36 | biimpa 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) |
| 38 | sneq 4598 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → {𝑣} = {𝑋}) | |
| 39 | 38 | uneq2d 4121 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (𝑈 ∪ {𝑣}) = (𝑈 ∪ {𝑋})) |
| 40 | 39 | fveqeq2d 6889 | . . . . 5 ⊢ (𝑣 = 𝑋 → ((𝑁‘(𝑈 ∪ {𝑣})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 41 | 40 | rspcev 3580 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 42 | 18, 37, 41 | syl2anc 595 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 43 | 7 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑊 ∈ LVec) |
| 44 | 3, 4, 21, 6 | islshp 39721 | . . . 4 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 45 | 43, 44 | syl 18 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 46 | 15, 17, 42, 45 | mpbir3and 1359 | . 2 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝐻) |
| 47 | 13, 46 | impbida 812 | 1 ⊢ (𝜑 → (𝑈 ∈ 𝐻 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 ∃wrex 3087 ∪ cun 3902 ⊆ wss 3904 {csn 4588 ‘cfv 6536 (class class class)co 7410 Basecbs 17268 LSSumclsm 19703 LModclmod 20960 LSubSpclss 21031 LSpanclspn 21071 LVecclvec 21202 LSHypclsh 39717 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-tpos 8221 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-0g 17493 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-submnd 18841 df-grp 19002 df-minusg 19003 df-sbg 19004 df-subg 19188 df-cntz 19386 df-lsm 19705 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-ring 20316 df-oppr 20418 df-dvdsr 20438 df-unit 20439 df-invr 20469 df-drng 20814 df-lmod 20962 df-lss 21032 df-lsp 21072 df-lvec 21203 df-lshyp 39719 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |