| 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 483 | . . 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 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑊 ∈ LVec) |
| 9 | simpr 487 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑈 ∈ 𝐻) | |
| 10 | lshpnel2.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 11 | 10 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → 𝑋 ∈ 𝑉) |
| 12 | 3, 4, 5, 6, 8, 9, 11 | lshpnelb 39546 | . . 3 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (¬ 𝑋 ∈ 𝑈 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| 13 | 2, 12 | mpbid 234 | . 2 ⊢ ((𝜑 ∧ 𝑈 ∈ 𝐻) → (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) |
| 14 | lshpnel2.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 15 | 14 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝑆) |
| 16 | lshpnel2.t | . . . 4 ⊢ (𝜑 → 𝑈 ≠ 𝑉) | |
| 17 | 16 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ≠ 𝑉) |
| 18 | 10 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑋 ∈ 𝑉) |
| 19 | lveclmod 21142 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 20 | 7, 19 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 21 | lshpnel2.s | . . . . . . . . . . 11 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 22 | 21, 4 | lspid 21018 | . . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑁‘𝑈) = 𝑈) |
| 23 | 20, 14, 22 | syl2anc 592 | . . . . . . . . 9 ⊢ (𝜑 → (𝑁‘𝑈) = 𝑈) |
| 24 | 23 | uneq1d 4111 | . . . . . . . 8 ⊢ (𝜑 → ((𝑁‘𝑈) ∪ (𝑁‘{𝑋})) = (𝑈 ∪ (𝑁‘{𝑋}))) |
| 25 | 24 | fveq2d 6856 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋}))) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 26 | 3, 21 | lssss 20972 | . . . . . . . . 9 ⊢ (𝑈 ∈ 𝑆 → 𝑈 ⊆ 𝑉) |
| 27 | 14, 26 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝑈 ⊆ 𝑉) |
| 28 | 10 | snssd 4735 | . . . . . . . 8 ⊢ (𝜑 → {𝑋} ⊆ 𝑉) |
| 29 | 3, 4 | lspun 21023 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ⊆ 𝑉 ∧ {𝑋} ⊆ 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 30 | 20, 27, 28, 29 | syl3anc 1382 | . . . . . . 7 ⊢ (𝜑 → (𝑁‘(𝑈 ∪ {𝑋})) = (𝑁‘((𝑁‘𝑈) ∪ (𝑁‘{𝑋})))) |
| 31 | 3, 21, 4 | lspsncl 21013 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → (𝑁‘{𝑋}) ∈ 𝑆) |
| 32 | 20, 10, 31 | syl2anc 592 | . . . . . . . 8 ⊢ (𝜑 → (𝑁‘{𝑋}) ∈ 𝑆) |
| 33 | 21, 4, 5 | lsmsp 21122 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ (𝑁‘{𝑋}) ∈ 𝑆) → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 34 | 20, 14, 32, 33 | syl3anc 1382 | . . . . . . 7 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ (𝑁‘{𝑋})))) |
| 35 | 25, 30, 34 | 3eqtr4rd 2798 | . . . . . 6 ⊢ (𝜑 → (𝑈 ⊕ (𝑁‘{𝑋})) = (𝑁‘(𝑈 ∪ {𝑋}))) |
| 36 | 35 | eqeq1d 2754 | . . . . 5 ⊢ (𝜑 → ((𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 37 | 36 | biimpa 479 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) |
| 38 | sneq 4582 | . . . . . . 7 ⊢ (𝑣 = 𝑋 → {𝑣} = {𝑋}) | |
| 39 | 38 | uneq2d 4112 | . . . . . 6 ⊢ (𝑣 = 𝑋 → (𝑈 ∪ {𝑣}) = (𝑈 ∪ {𝑋})) |
| 40 | 39 | fveqeq2d 6860 | . . . . 5 ⊢ (𝑣 = 𝑋 → ((𝑁‘(𝑈 ∪ {𝑣})) = 𝑉 ↔ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉)) |
| 41 | 40 | rspcev 3572 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ (𝑁‘(𝑈 ∪ {𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 42 | 18, 37, 41 | syl2anc 592 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉) |
| 43 | 7 | adantr 483 | . . . 4 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑊 ∈ LVec) |
| 44 | 3, 4, 21, 6 | islshp 39541 | . . . 4 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 45 | 43, 44 | syl 17 | . . 3 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → (𝑈 ∈ 𝐻 ↔ (𝑈 ∈ 𝑆 ∧ 𝑈 ≠ 𝑉 ∧ ∃𝑣 ∈ 𝑉 (𝑁‘(𝑈 ∪ {𝑣})) = 𝑉))) |
| 46 | 15, 17, 42, 45 | mpbir3and 1352 | . 2 ⊢ ((𝜑 ∧ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉) → 𝑈 ∈ 𝐻) |
| 47 | 13, 46 | impbida 808 | 1 ⊢ (𝜑 → (𝑈 ∈ 𝐻 ↔ (𝑈 ⊕ (𝑁‘{𝑋})) = 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1095 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∃wrex 3076 ∪ cun 3893 ⊆ wss 3895 {csn 4572 ‘cfv 6506 (class class class)co 7381 Basecbs 17217 LSSumclsm 19646 LModclmod 20896 LSubSpclss 20967 LSpanclspn 21007 LVecclvec 21138 LSHypclsh 39537 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-tpos 8190 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-nn 12197 df-2 12266 df-3 12267 df-sets 17172 df-slot 17190 df-ndx 17202 df-base 17218 df-ress 17239 df-plusg 17271 df-mulr 17272 df-0g 17442 df-mgm 18646 df-sgrp 18725 df-mnd 18741 df-submnd 18790 df-grp 18950 df-minusg 18951 df-sbg 18952 df-subg 19137 df-cntz 19329 df-lsm 19648 df-cmn 19794 df-abl 19795 df-mgp 20159 df-rng 20171 df-ur 20200 df-ring 20253 df-oppr 20354 df-dvdsr 20374 df-unit 20375 df-invr 20405 df-drng 20749 df-lmod 20898 df-lss 20968 df-lsp 21008 df-lvec 21139 df-lshyp 39539 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |