Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lkrfval | Structured version Visualization version GIF version |
Description: The kernel of a functional. (Contributed by NM, 15-Apr-2014.) (Revised by Mario Carneiro, 24-Jun-2014.) |
Ref | Expression |
---|---|
lkrfval.d | ⊢ 𝐷 = (Scalar‘𝑊) |
lkrfval.o | ⊢ 0 = (0g‘𝐷) |
lkrfval.f | ⊢ 𝐹 = (LFnl‘𝑊) |
lkrfval.k | ⊢ 𝐾 = (LKer‘𝑊) |
Ref | Expression |
---|---|
lkrfval | ⊢ (𝑊 ∈ 𝑋 → 𝐾 = (𝑓 ∈ 𝐹 ↦ (◡𝑓 “ { 0 }))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3450 | . 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
2 | lkrfval.k | . . 3 ⊢ 𝐾 = (LKer‘𝑊) | |
3 | fveq2 6774 | . . . . . 6 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = (LFnl‘𝑊)) | |
4 | lkrfval.f | . . . . . 6 ⊢ 𝐹 = (LFnl‘𝑊) | |
5 | 3, 4 | eqtr4di 2796 | . . . . 5 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = 𝐹) |
6 | fveq2 6774 | . . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊)) | |
7 | lkrfval.d | . . . . . . . . . 10 ⊢ 𝐷 = (Scalar‘𝑊) | |
8 | 6, 7 | eqtr4di 2796 | . . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐷) |
9 | 8 | fveq2d 6778 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘(Scalar‘𝑤)) = (0g‘𝐷)) |
10 | lkrfval.o | . . . . . . . 8 ⊢ 0 = (0g‘𝐷) | |
11 | 9, 10 | eqtr4di 2796 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (0g‘(Scalar‘𝑤)) = 0 ) |
12 | 11 | sneqd 4573 | . . . . . 6 ⊢ (𝑤 = 𝑊 → {(0g‘(Scalar‘𝑤))} = { 0 }) |
13 | 12 | imaeq2d 5969 | . . . . 5 ⊢ (𝑤 = 𝑊 → (◡𝑓 “ {(0g‘(Scalar‘𝑤))}) = (◡𝑓 “ { 0 })) |
14 | 5, 13 | mpteq12dv 5165 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑓 ∈ (LFnl‘𝑤) ↦ (◡𝑓 “ {(0g‘(Scalar‘𝑤))})) = (𝑓 ∈ 𝐹 ↦ (◡𝑓 “ { 0 }))) |
15 | df-lkr 37100 | . . . 4 ⊢ LKer = (𝑤 ∈ V ↦ (𝑓 ∈ (LFnl‘𝑤) ↦ (◡𝑓 “ {(0g‘(Scalar‘𝑤))}))) | |
16 | 14, 15, 4 | mptfvmpt 7104 | . . 3 ⊢ (𝑊 ∈ V → (LKer‘𝑊) = (𝑓 ∈ 𝐹 ↦ (◡𝑓 “ { 0 }))) |
17 | 2, 16 | eqtrid 2790 | . 2 ⊢ (𝑊 ∈ V → 𝐾 = (𝑓 ∈ 𝐹 ↦ (◡𝑓 “ { 0 }))) |
18 | 1, 17 | syl 17 | 1 ⊢ (𝑊 ∈ 𝑋 → 𝐾 = (𝑓 ∈ 𝐹 ↦ (◡𝑓 “ { 0 }))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 Vcvv 3432 {csn 4561 ↦ cmpt 5157 ◡ccnv 5588 “ cima 5592 ‘cfv 6433 Scalarcsca 16965 0gc0g 17150 LFnlclfn 37071 LKerclk 37099 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-lkr 37100 |
This theorem is referenced by: lkrval 37102 |
Copyright terms: Public domain | W3C validator |