| 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 2763 | . . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 3 | lkr0f.v | . . . . . . 7 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lkr0f.f | . . . . . . 7 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 5 | 1, 2, 3, 4 | lflf 40386 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺:𝑉⟶(Base‘𝐷)) |
| 6 | 5 | ffnd 6740 | . . . . 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 40411 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 11 | 10 | eqeq1d 2765 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 12 | 11 | biimpa 482 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) ∧ (𝐾‘𝐺) = 𝑉) → (◡𝐺 “ { 0 }) = 𝑉) |
| 13 | 8 | fvexi 6930 | . . . . . 6 ⊢ 0 ∈ V |
| 14 | 13 | fconst2 7242 | . . . . 5 ⊢ (𝐺:𝑉⟶{ 0 } ↔ 𝐺 = (𝑉 × { 0 })) |
| 15 | fconst4 7251 | . . . . 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 2763 | . . . . . . . . . . 11 ⊢ (LFnl‘𝑊) = (LFnl‘𝑊) | |
| 22 | 1, 8, 3, 21 | lfl0f 40392 | . . . . . . . . . 10 ⊢ (𝑊 ∈ LMod → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 23 | 22 | adantr 486 | . . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝑉 × { 0 }) ∈ (LFnl‘𝑊)) |
| 24 | 20, 23 | eqeltrd 2864 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → 𝐺 ∈ (LFnl‘𝑊)) |
| 25 | 1, 8, 21, 9 | lkrval 40411 | . . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ (LFnl‘𝑊)) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 26 | 24, 25 | syldan 603 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → (𝐾‘𝐺) = (◡𝐺 “ { 0 })) |
| 27 | 26 | eqeq1d 2765 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 = (𝑉 × { 0 })) → ((𝐾‘𝐺) = 𝑉 ↔ (◡𝐺 “ { 0 }) = 𝑉)) |
| 28 | ffn 6739 | . . . . . . . . 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 1570 ∈ wcel 2147 {csn 4588 × cxp 5656 ◡ccnv 5657 “ cima 5661 Fn wfn 6561 ⟶wf 6562 ‘cfv 6566 Basecbs 17431 Scalarcsca 17475 0gc0g 17660 LModclmod 21186 LFnlclfn 40380 LKerclk 40408 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-lmod 21188 df-lfl 40381 df-lkr 40409 |
| This theorem is used by: lkrscss 40421 eqlkr 40422 lkrshp 40428 lkrshp3 40429 lkrshpor 40430 lfl1dim 40444 lfl1dim2N 40445 lkr0f2 40484 lclkrlem1 42829 lclkrlem2j 42839 lclkr 42856 lclkrs 42862 mapd0 42988 |
| Copyright terms: Public domain | W3C validator |