Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > islshpkrN | Structured version Visualization version GIF version |
Description: The predicate "is a hyperplane" (of a left module or left vector space). TODO: should it be 𝑈 = (𝐾‘𝑔) or (𝐾‘𝑔) = 𝑈 as in lshpkrex 36248? Both standards seem to be used randomly throughout set.mm; we should decide on a preferred one. (Contributed by NM, 7-Oct-2014.) (New usage is discouraged.) |
Ref | Expression |
---|---|
lshpset2.v | ⊢ 𝑉 = (Base‘𝑊) |
lshpset2.d | ⊢ 𝐷 = (Scalar‘𝑊) |
lshpset2.z | ⊢ 0 = (0g‘𝐷) |
lshpset2.h | ⊢ 𝐻 = (LSHyp‘𝑊) |
lshpset2.f | ⊢ 𝐹 = (LFnl‘𝑊) |
lshpset2.k | ⊢ 𝐾 = (LKer‘𝑊) |
Ref | Expression |
---|---|
islshpkrN | ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lshpset2.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
2 | lshpset2.d | . . . 4 ⊢ 𝐷 = (Scalar‘𝑊) | |
3 | lshpset2.z | . . . 4 ⊢ 0 = (0g‘𝐷) | |
4 | lshpset2.h | . . . 4 ⊢ 𝐻 = (LSHyp‘𝑊) | |
5 | lshpset2.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑊) | |
6 | lshpset2.k | . . . 4 ⊢ 𝐾 = (LKer‘𝑊) | |
7 | 1, 2, 3, 4, 5, 6 | lshpset2N 36249 | . . 3 ⊢ (𝑊 ∈ LVec → 𝐻 = {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))}) |
8 | 7 | eleq2d 2898 | . 2 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ 𝑈 ∈ {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))})) |
9 | elex 3512 | . . . 4 ⊢ (𝑈 ∈ {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))} → 𝑈 ∈ V) | |
10 | 9 | adantl 484 | . . 3 ⊢ ((𝑊 ∈ LVec ∧ 𝑈 ∈ {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))}) → 𝑈 ∈ V) |
11 | fvex 6677 | . . . . . . 7 ⊢ (𝐾‘𝑔) ∈ V | |
12 | eleq1 2900 | . . . . . . 7 ⊢ (𝑈 = (𝐾‘𝑔) → (𝑈 ∈ V ↔ (𝐾‘𝑔) ∈ V)) | |
13 | 11, 12 | mpbiri 260 | . . . . . 6 ⊢ (𝑈 = (𝐾‘𝑔) → 𝑈 ∈ V) |
14 | 13 | adantl 484 | . . . . 5 ⊢ ((𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)) → 𝑈 ∈ V) |
15 | 14 | rexlimivw 3282 | . . . 4 ⊢ (∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)) → 𝑈 ∈ V) |
16 | 15 | adantl 484 | . . 3 ⊢ ((𝑊 ∈ LVec ∧ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔))) → 𝑈 ∈ V) |
17 | eqeq1 2825 | . . . . . 6 ⊢ (𝑠 = 𝑈 → (𝑠 = (𝐾‘𝑔) ↔ 𝑈 = (𝐾‘𝑔))) | |
18 | 17 | anbi2d 630 | . . . . 5 ⊢ (𝑠 = 𝑈 → ((𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔)) ↔ (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
19 | 18 | rexbidv 3297 | . . . 4 ⊢ (𝑠 = 𝑈 → (∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔)) ↔ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
20 | 19 | elabg 3665 | . . 3 ⊢ (𝑈 ∈ V → (𝑈 ∈ {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))} ↔ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
21 | 10, 16, 20 | pm5.21nd 800 | . 2 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ {𝑠 ∣ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑠 = (𝐾‘𝑔))} ↔ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
22 | 8, 21 | bitrd 281 | 1 ⊢ (𝑊 ∈ LVec → (𝑈 ∈ 𝐻 ↔ ∃𝑔 ∈ 𝐹 (𝑔 ≠ (𝑉 × { 0 }) ∧ 𝑈 = (𝐾‘𝑔)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {cab 2799 ≠ wne 3016 ∃wrex 3139 Vcvv 3494 {csn 4560 × cxp 5547 ‘cfv 6349 Basecbs 16477 Scalarcsca 16562 0gc0g 16707 LVecclvec 19868 LSHypclsh 36105 LFnlclfn 36187 LKerclk 36215 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-tpos 7886 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-map 8402 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-plusg 16572 df-mulr 16573 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-submnd 17951 df-grp 18100 df-minusg 18101 df-sbg 18102 df-subg 18270 df-cntz 18441 df-lsm 18755 df-cmn 18902 df-abl 18903 df-mgp 19234 df-ur 19246 df-ring 19293 df-oppr 19367 df-dvdsr 19385 df-unit 19386 df-invr 19416 df-drng 19498 df-lmod 19630 df-lss 19698 df-lsp 19738 df-lvec 19869 df-lshyp 36107 df-lfl 36188 df-lkr 36216 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |