Metamath Proof Explorer


Theorem lcfls1c

Description: Property of a functional with a closed kernel. (Contributed by NM, 28-Jan-2015)

Ref Expression
Hypotheses lcfls1.c 𝐶 = { 𝑓𝐹 ∣ ( ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( ‘ ( 𝐿𝑓 ) ) ⊆ 𝑄 ) }
lcfls1c.c 𝐷 = { 𝑓𝐹 ∣ ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) }
Assertion lcfls1c ( 𝐺𝐶 ↔ ( 𝐺𝐷 ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )

Proof

Step Hyp Ref Expression
1 lcfls1.c 𝐶 = { 𝑓𝐹 ∣ ( ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( ‘ ( 𝐿𝑓 ) ) ⊆ 𝑄 ) }
2 lcfls1c.c 𝐷 = { 𝑓𝐹 ∣ ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) }
3 df-3an ( ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ↔ ( ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )
4 1 lcfls1lem ( 𝐺𝐶 ↔ ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )
5 2 lcfl1lem ( 𝐺𝐷 ↔ ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ) )
6 5 anbi1i ( ( 𝐺𝐷 ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ↔ ( ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )
7 3 4 6 3bitr4i ( 𝐺𝐶 ↔ ( 𝐺𝐷 ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )