Metamath Proof Explorer


Theorem lcfls1lem

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

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

Proof

Step Hyp Ref Expression
1 lcfls1.c 𝐶 = { 𝑓𝐹 ∣ ( ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( ‘ ( 𝐿𝑓 ) ) ⊆ 𝑄 ) }
2 fveq2 ( 𝑓 = 𝐺 → ( 𝐿𝑓 ) = ( 𝐿𝐺 ) )
3 2 fveq2d ( 𝑓 = 𝐺 → ( ‘ ( 𝐿𝑓 ) ) = ( ‘ ( 𝐿𝐺 ) ) )
4 3 fveq2d ( 𝑓 = 𝐺 → ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) )
5 4 2 eqeq12d ( 𝑓 = 𝐺 → ( ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ↔ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ) )
6 3 sseq1d ( 𝑓 = 𝐺 → ( ( ‘ ( 𝐿𝑓 ) ) ⊆ 𝑄 ↔ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )
7 5 6 anbi12d ( 𝑓 = 𝐺 → ( ( ( ‘ ( ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( ‘ ( 𝐿𝑓 ) ) ⊆ 𝑄 ) ↔ ( ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ) )
8 7 1 elrab2 ( 𝐺𝐶 ↔ ( 𝐺𝐹 ∧ ( ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ) )
9 3anass ( ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ↔ ( 𝐺𝐹 ∧ ( ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) ) )
10 8 9 bitr4i ( 𝐺𝐶 ↔ ( 𝐺𝐹 ∧ ( ‘ ( ‘ ( 𝐿𝐺 ) ) ) = ( 𝐿𝐺 ) ∧ ( ‘ ( 𝐿𝐺 ) ) ⊆ 𝑄 ) )