| 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 2760 | . . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 3 | lkr0f.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lkr0f.f | . . . . . . 7 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 5 | 1, 2, 3, 4 | lflf 40229 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺:𝑉⟶(Base‘𝐷)) |
| 6 | 5 | ffnd 6715 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺 Fn 𝑉) |
| 7 | 6 | adantr 486 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → 𝐺 Fn 𝑉) |
| 8 | lkr0f.o | . . . . . . 7 ⊢ 0 = (0g‘𝐷) | |
| 9 | lkr0f.k | . . . . . . 7 ⊢ 𝐾 = (LKer‘𝑊) | |
| 10 | 1, 8, 4, 9 | lkrval 40254 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 11 | 10 | eqeq1d 2762 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 12 | 11 | biimpa 482 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → (◡𝐺 “ { 0 }) = 𝑉) |
| 13 | 8 | fvexi 6904 | . . . . . 6 ⊢ 0 ∈ V |
| 14 | 13 | fconst2 7215 | . . . . 5 ⊢ (𝐺:𝑉⟶{ 0 } ↔ 𝐺 = (𝑉 × { 0 })) |
| 15 | fconst4 7224 | . . . . 5 ⊢ (𝐺:𝑉⟶{ 0 } ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) | |
| 16 | 14, 15 | bitr3i 280 | . . . 4 ⊢ (𝐺 = (𝑉 × { 0 }) ↔ (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) |
| 17 | 7, 12, 16 | sylanbrc 595 | . . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → 𝐺 = (𝑉 × { 0 })) |
| 18 | 17 | ex 418 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 → 𝐺 = (𝑉 × { 0 }))) |
| 19 | 16 | bilani 510 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐺 Fn 𝑉 ∧ (◡𝐺 “ { 0 }) = 𝑉)) |
| 20 | simpr 490 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 = (𝑉 × { 0 })) | |
| 21 | eqid 2760 | . . . . . . . . . . 11 ⊢ (LFnl‘𝑊) = (LFnl‘𝑊) | |
| 22 | 1, 8, 3, 21 | lfl0f 40235 | . . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 23 | 22 | adantr 486 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 24 | 20, 23 | eqeltrd 2860 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 ∈ (LFnl‘𝑊)) |
| 25 | 1, 8, 21, 9 | lkrval 40254 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ (LFnl‘𝑊)) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 26 | 24, 25 | syldan 603 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 27 | 26 | eqeq1d 2762 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 28 | ffn 6714 | . . . . . . . . 9 ⊢ (𝐺:𝑉⟶{ 0 } → 𝐺 Fn 𝑉) | |
| 29 | 14, 28 | sylbir 238 | . . . . . . . 8 ⊢ (𝐺 = (𝑉 × { 0 }) → 𝐺 Fn 𝑉) |
| 30 | 29 | adantl 487 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 Fn 𝑉) |
| 31 | 30 | biantrurd 542 | . . . . . 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 418 | . . 3 ⊢ (𝑊 ∈ LMod → (𝐺 = (𝑉 × { 0 }) → (𝐾‘𝐺) = 𝑉)) |
| 35 | 34 | adantr 486 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐺 = (𝑉 × { 0 }) → (𝐾‘𝐺) = 𝑉)) |
| 36 | 18, 35 | impbid 215 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ 𝐺 = (𝑉 × { 0 }))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 {csn 4584 × cxp 5649 ◡ccnv 5650 “ cima 5654 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 Basecbs 17396 Scalarcsca 17440 0gc0g 17619 LModclmod 21144 LFnlclfn 40223 LKerclk 40251 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-er 8724 df-map 8856 df-en 8981 df-dom 8982 df-sdom 8983 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-plusg 17450 df-0g 17621 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-grp 19156 df-minusg 19157 df-cmn 20005 df-abl 20006 df-mgp 20370 df-rng 20384 df-ur 20417 df-ring 20470 df-lmod 21146 df-lfl 40224 df-lkr 40252 |
| This theorem is used by: lkrscss 40264 eqlkr 40265 lkrshp 40271 lkrshp3 40272 lkrshpor 40273 lfl1dim 40287 lfl1dim2N 40288 lkr0f2 40327 lclkrlem1 42672 lclkrlem2j 42682 lclkr 42699 lclkrs 42705 mapd0 42831 |
| Copyright terms: Public domain | W3C validator |