| 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 486 | . . 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 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑊 ∈ LVec) |
| 9 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑈 ∈ 𝐻) | |
| 10 | lshpnel2.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 11 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑋 ∈ 𝑉) |
| 12 | 3, 4, 5, 6, 8, 9, 11 | lshpnelb 39859 | . . 3 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (¬ 𝑋 ∈ 𝑈 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| 13 | 2, 12 | mpbid 235 | . 2 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) |
| 14 | lshpnel2.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 15 | 14 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝑆) |
| 16 | lshpnel2.t | . . . 4 ⊢ (𝜑 → 𝑈 ≠ 𝑉) | |
| 17 | 16 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ≠ 𝑉) |
| 18 | 10 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑋 ∈ 𝑉) |
| 19 | lveclmod 21294 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 20 | 7, 19 | syl 18 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 21 | lshpnel2.s | . . . . . . . . . . 11 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 22 | 21, 4 | lspid 21170 | . . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑁‘𝑈) = 𝑈) |
| 23 | 20, 14, 22 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → (𝑁‘𝑈) = 𝑈) |
| 24 | 23 | uneq1d 4117 | . . . . . . . 8 ⊢ (𝜑 → ((𝑁‘𝑈) ∪ (𝑁‘{𝑋})) = (𝑈 ∪ (𝑁‘{𝑋}))) |
| 25 | 24 | fveq2d 6886 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋}))) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 26 | 3, 21 | lssss 21124 | . . . . . . . . 9 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉) |
| 27 | 14, 26 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ⊆ 𝑉) |
| 28 | 10 | snssd 4750 | . . . . . . . 8 ⊢ (𝜑 → {𝑋} ⊆ 𝑉) |
| 29 | 3, 4 | lspun 21175 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ∧ {𝑋} ⊆ 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 30 | 20, 27, 28, 29 | syl3anc 1398 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 31 | 3, 21, 4 | lspsncl 21165 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ 𝑆) |
| 32 | 20, 10, 31 | syl2anc 596 | . . . . . . . 8 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ 𝑆) |
| 33 | 21, 4, 5 | lsmsp 21274 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑁‘{𝑋}) ∈ 𝑆) → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 34 | 20, 14, 32, 33 | syl3anc 1398 | . . . . . . 7 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 35 | 25, 30, 34 | 3eqtr4rd 2808 | . . . . . 6 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ {𝑋}))) |
| 36 | 35 | eqeq1d 2764 | . . . . 5 ⊢ (𝜑 → ((𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 37 | 36 | biimpa 482 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) |
| 38 | sneq 4597 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → {𝑣} = {𝑋}) | |
| 39 | 38 | uneq2d 4118 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (𝑈 ∪ {𝑣}) = (𝑈 ∪ {𝑋})) |
| 40 | 39 | fveqeq2d 6890 | . . . . 5 ⊢ (𝑣 = 𝑋 → ((𝑁‘(𝑈 ∪ {𝑣})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 41 | 40 | rspcev 3579 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 42 | 18, 37, 41 | syl2anc 596 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 43 | 7 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑊 ∈ LVec) |
| 44 | 3, 4, 21, 6 | islshp 39854 | . . . 4 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 45 | 43, 44 | syl 18 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 46 | 15, 17, 42, 45 | mpbir3and 1361 | . 2 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝐻) |
| 47 | 13, 46 | impbida 813 | 1 ⊢ (𝜑 → (𝑈 ∈ 𝐻 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∃wrex 3088 ∪ cun 3900 ⊆ wss 3902 {csn 4587 ‘cfv 6537 (class class class)co 7416 Basecbs 17305 LSSumclsm 19765 LModclmod 21048 LSubSpclss 21119 LSpanclspn 21159 LVecclvec 21290 LSHypclsh 39850 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 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 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 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 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-tpos 8227 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-mulr 17360 df-0g 17530 df-mgm 18734 df-sgrp 18825 df-mnd 18841 df-submnd 18896 df-grp 19064 df-minusg 19065 df-sbg 19066 df-subg 19250 df-cntz 19448 df-lsm 19767 df-cmn 19913 df-abl 19914 df-mgp 20278 df-rng 20292 df-ur 20325 df-ring 20378 df-oppr 20482 df-dvdsr 20502 df-unit 20503 df-invr 20533 df-drng 20896 df-lmod 21050 df-lss 21120 df-lsp 21160 df-lvec 21291 df-lshyp 39852 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |