| 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 6888 | . . . . 5 ⊢ (𝑓 = 𝐺 → (𝐿‘𝑓) = (𝐿‘𝐺)) | |
| 2 | 1 | fveq2d 6892 | . . . 4 ⊢ (𝑓 = 𝐺 → ( ⊥ ‘(𝐿‘𝑓)) = ( ⊥ ‘(𝐿‘𝐺))) |
| 3 | 2 | fveq2d 6892 | . . 3 ⊢ (𝑓 = 𝐺 → ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺)))) |
| 4 | 3, 1 | eqeq12d 2782 | . 2 ⊢ (𝑓 = 𝐺 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓) ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| 5 | lcfl1.c | . 2 ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)} | |
| 6 | 4, 5 | elrab2 3657 | 1 ⊢ (𝐺 ∈ 𝐶 ↔ (𝐺 ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3419 ‘cfv 6543 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-iota 6499 df-fv 6551 |
| This theorem is used by: lcfl1 42307 lcfl8b 42319 lclkrlem1 42321 lclkrlem2 42347 lclkr 42348 lcfls1c 42351 lcfrlem9 42365 mapdvalc 42444 mapdval2N 42445 mapdval4N 42447 mapdordlem1a 42449 mapdordlem1bN 42450 mapdrvallem2 42460 |
| Copyright terms: Public domain | W3C validator |