Theorem lcfl1 42216

Description: Property of a functional with a closed kernel. (Contributed by NM, 31-Dec-2014.)

Hypotheses

Ref	Expression
lcfl1.c	⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)}
lcfl1.g	⊢ (𝜑 → 𝐺 ∈ 𝐹)

Assertion

Ref	Expression
lcfl1	⊢ (𝜑 → (𝐺 ∈ 𝐶 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))

Distinct variable groups:   𝑓,𝐹   𝑓,𝐺   𝑓,𝐿   ⊥ ,𝑓

Allowed substitution hints:   𝜑(𝑓)   𝐶(𝑓)

Proof of Theorem lcfl1

Step	Hyp	Ref	Expression
1		lcfl1.c	. . 3 ⊢ 𝐶 = {𝑓 ∈ 𝐹 ∣ ( ⊥ ‘( ⊥ ‘(𝐿‘𝑓))) = (𝐿‘𝑓)}
2	1	lcfl1lem 42215	. 2 ⊢ (𝐺 ∈ 𝐶 ↔ (𝐺 ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))
3		lcfl1.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐹)
4	3	biantrurd 541	. 2 ⊢ (𝜑 → (( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺) ↔ (𝐺 ∈ 𝐹 ∧ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺))))
5	2, 4	bitr4id 293	1 ⊢ (𝜑 → (𝐺 ∈ 𝐶 ↔ ( ⊥ ‘( ⊥ ‘(𝐿‘𝐺))) = (𝐿‘𝐺)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1568   ∈ wcel 2150  {crab 3423  ‘cfv 6540

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-rab 3424  df-v 3464  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 4878  df-br 5115  df-iota 6496  df-fv 6548

This theorem is referenced by:  lcfl2  42217  lcfl5  42220  lcfl5a  42221  lcfl6  42224  lcfl8  42226  lcfl8a  42227  lclkrlem2  42256