| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lcfl1lem | Structured version Visualization version GIF version | ||
| Description: Property of a functional with a closed kernel. (Contributed by NM, 28-Dec-2014.) |
| Ref | Expression |
|---|---|
| lcfl1.c | ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)} |
| Ref | Expression |
|---|---|
| lcfl1lem | ⊢ (𝐺 ∈ 𝐶 ↔ (𝐺 ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6882 | . . . . 5 ⊢ (𝑓 = 𝐺 → (𝐿‘𝑓) = (𝐿‘𝐺)) | |
| 2 | 1 | fveq2d 6886 | . . . 4 ⊢ (𝑓 = 𝐺 → ( ⊥ ‘(𝐿‘𝑓)) = ( ⊥ ‘(𝐿‘𝐺))) |
| 3 | 2 | fveq2d 6886 | . . 3 ⊢ (𝑓 = 𝐺 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺)))) |
| 4 | 3, 1 | eqeq12d 2785 | . 2 ⊢ (𝑓 = 𝐺 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| 5 | lcfl1.c | . 2 ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)} | |
| 6 | 4, 5 | elrab2 3663 | 1 ⊢ (𝐺 ∈ 𝐶 ↔ (𝐺 ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {crab 3423 ‘cfv 6537 |
| 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-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 |
| This theorem is referenced by: lcfl1 42155 lcfl8b 42167 lclkrlem1 42169 lclkrlem2 42195 lclkr 42196 lcfls1c 42199 lcfrlem9 42213 mapdvalc 42292 mapdval2N 42293 mapdval4N 42295 mapdordlem1a 42297 mapdordlem1bN 42298 mapdrvallem2 42308 |
| Copyright terms: Public domain | W3C validator |