Metamath Proof Explorer


Theorem fnresfnco

Description: Composition of two functions, similar to fnco . (Contributed by Alexander van der Vekens, 25-Jul-2017)

Ref Expression
Assertion fnresfnco ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → F ∘ G Fn B

Proof

Step Hyp Ref Expression
1 fnfun ⊢ F ↾ ran ⁡ G Fn ran ⁡ G → Fun ⁡ F ↾ ran ⁡ G
2 fnfun ⊢ G Fn B → Fun ⁡ G
3 funresfunco ⊢ Fun ⁡ F ↾ ran ⁡ G ∧ Fun ⁡ G → Fun ⁡ F ∘ G
4 1 2 3 syl2an ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → Fun ⁡ F ∘ G
5 fndm ⊢ F ↾ ran ⁡ G Fn ran ⁡ G → dom ⁡ F ↾ ran ⁡ G = ran ⁡ G
6 dmres ⊢ dom ⁡ F ↾ ran ⁡ G = ran ⁡ G ∩ dom ⁡ F
7 6 eqeq1i ⊢ dom ⁡ F ↾ ran ⁡ G = ran ⁡ G ↔ ran ⁡ G ∩ dom ⁡ F = ran ⁡ G
8 dfss2 ⊢ ran ⁡ G ⊆ dom ⁡ F ↔ ran ⁡ G ∩ dom ⁡ F = ran ⁡ G
9 7 8 sylbb2 ⊢ dom ⁡ F ↾ ran ⁡ G = ran ⁡ G → ran ⁡ G ⊆ dom ⁡ F
10 5 9 syl ⊢ F ↾ ran ⁡ G Fn ran ⁡ G → ran ⁡ G ⊆ dom ⁡ F
11 10 adantr ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → ran ⁡ G ⊆ dom ⁡ F
12 dmcosseq ⊢ ran ⁡ G ⊆ dom ⁡ F → dom ⁡ F ∘ G = dom ⁡ G
13 11 12 syl ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → dom ⁡ F ∘ G = dom ⁡ G
14 fndm ⊢ G Fn B → dom ⁡ G = B
15 14 adantl ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → dom ⁡ G = B
16 13 15 eqtrd ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → dom ⁡ F ∘ G = B
17 df-fn ⊢ F ∘ G Fn B ↔ Fun ⁡ F ∘ G ∧ dom ⁡ F ∘ G = B
18 4 16 17 sylanbrc ⊢ F ↾ ran ⁡ G Fn ran ⁡ G ∧ G Fn B → F ∘ G Fn B