| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lkr0f | Structured version Visualization version GIF version | ||
| Description: The kernel of the zero functional is the set of all vectors. (Contributed by NM, 17-Apr-2014.) |
| Ref | Expression |
|---|---|
| lkr0f.d | ⊢ 𝐷 = (Scalar‘𝑊) |
| lkr0f.o | ⊢ 0 = (0g‘𝐷) |
| lkr0f.v | ⊢ 𝑉 = (Base‘𝑊) |
| lkr0f.f | ⊢ 𝐹 = (LFnl‘𝑊) |
| lkr0f.k | ⊢ 𝐾 = (LKer‘𝑊) |
| Ref | Expression |
|---|---|
| lkr0f | ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ 𝐺 = (𝑉 × { 0 }))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lkr0f.d | . . . . . . 7 ⊢ 𝐷 = (Scalar‘𝑊) | |
| 2 | eqid 2769 | . . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 3 | lkr0f.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lkr0f.f | . . . . . . 7 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 5 | 1, 2, 3, 4 | lflf 39764 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺:𝑉⟶(Base‘𝐷)) |
| 6 | 5 | ffnd 6709 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺 Fn 𝑉) |
| 7 | 6 | adantr 485 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → 𝐺 Fn 𝑉) |
| 8 | lkr0f.o | . . . . . . 7 ⊢ 0 = (0g‘𝐷) | |
| 9 | lkr0f.k | . . . . . . 7 ⊢ 𝐾 = (LKer‘𝑊) | |
| 10 | 1, 8, 4, 9 | lkrval 39789 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 11 | 10 | eqeq1d 2771 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 12 | 11 | biimpa 481 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → (◡𝐺 “ { 0 }) = 𝑉) |
| 13 | 8 | fvexi 6898 | . . . . . 6 ⊢ 0 ∈ V |
| 14 | 13 | fconst2 7206 | . . . . 5 ⊢ (𝐺:𝑉⟶{ 0 } ↔ 𝐺 = (𝑉 × { 0 })) |
| 15 | fconst4 7215 | . . . . 5 ⊢ (𝐺:𝑉⟶{ 0 } ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) | |
| 16 | 14, 15 | bitr3i 280 | . . . 4 ⊢ (𝐺 = (𝑉 × { 0 }) ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) |
| 17 | 7, 12, 16 | sylanbrc 594 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → 𝐺 = (𝑉 × { 0 })) |
| 18 | 17 | ex 417 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 → 𝐺 = (𝑉 × { 0 }))) |
| 19 | 16 | bilani 509 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) |
| 20 | simpr 489 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 = (𝑉 × { 0 })) | |
| 21 | eqid 2769 | . . . . . . . . . . 11 ⊢ (LFnl‘𝑊) = (LFnl‘𝑊) | |
| 22 | 1, 8, 3, 21 | lfl0f 39770 | . . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 23 | 22 | adantr 485 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 24 | 20, 23 | eqeltrd 2869 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 ∈ (LFnl‘𝑊)) |
| 25 | 1, 8, 21, 9 | lkrval 39789 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ (LFnl‘𝑊)) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 26 | 24, 25 | syldan 602 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 27 | 26 | eqeq1d 2771 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 28 | ffn 6708 | . . . . . . . . 9 ⊢ (𝐺:𝑉⟶{ 0 } → 𝐺 Fn 𝑉) | |
| 29 | 14, 28 | sylbir 238 | . . . . . . . 8 ⊢ (𝐺 = (𝑉 × { 0 }) → 𝐺 Fn 𝑉) |
| 30 | 29 | adantl 486 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 Fn 𝑉) |
| 31 | 30 | biantrurd 541 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → ((◡𝐺 “ { 0 }) = 𝑉 ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉))) |
| 32 | 27, 31 | bitrd 282 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → ((𝐾‘𝐺) = 𝑉 ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉))) |
| 33 | 19, 32 | mpbird 260 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐾‘𝐺) = 𝑉) |
| 34 | 33 | ex 417 | . . 3 ⊢ (𝑊 ∈ LMod → (𝐺 = (𝑉 × { 0 }) → (𝐾‘𝐺) = 𝑉)) |
| 35 | 34 | adantr 485 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐺 = (𝑉 × { 0 }) → (𝐾‘𝐺) = 𝑉)) |
| 36 | 18, 35 | impbid 215 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ 𝐺 = (𝑉 × { 0 }))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {csn 4594 × cxp 5662 ◡ccnv 5663 “ cima 5667 Fn wfn 6534 ⟶wf 6535 ‘cfv 6539 Basecbs 17271 Scalarcsca 17315 0gc0g 17494 LModclmod 20961 LFnlclfn 39758 LKerclk 39786 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5273 ax-pow 5339 ax-pr 5407 ax-un 7735 ax-cnex 11158 ax-resscn 11159 ax-1cn 11160 ax-icn 11161 ax-addcl 11162 ax-addrcl 11163 ax-mulcl 11164 ax-mulrcl 11165 ax-mulcom 11166 ax-addass 11167 ax-mulass 11168 ax-distr 11169 ax-i2m1 11170 ax-1ne0 11171 ax-1rid 11172 ax-rnegex 11173 ax-rrecex 11174 ax-cnre 11175 ax-pre-lttri 11176 ax-pre-lttrn 11177 ax-pre-ltadd 11178 ax-pre-mulgt0 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6305 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6495 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11445 df-neg 11446 df-nn 12236 df-2 12305 df-sets 17226 df-slot 17244 df-ndx 17256 df-base 17272 df-plusg 17325 df-0g 17496 df-mgm 18700 df-sgrp 18779 df-mnd 18795 df-grp 19005 df-minusg 19006 df-cmn 19854 df-abl 19855 df-mgp 20219 df-rng 20233 df-ur 20266 df-ring 20319 df-lmod 20963 df-lfl 39759 df-lkr 39787 |
| This theorem is referenced by: lkrscss 39799 eqlkr 39800 lkrshp 39806 lkrshp3 39807 lkrshpor 39808 lfl1dim 39822 lfl1dim2N 39823 lkr0f2 39862 lclkrlem1 42207 lclkrlem2j 42217 lclkr 42234 lclkrs 42240 mapd0 42366 |
| Copyright terms: Public domain | W3C validator |