Metamath Proof Explorer


Theorem fcof

Description: Composition of a function with domain and codomain and a function as a function with domain and codomain. Generalization of fco . (Contributed by AV, 18-Sep-2024)

Ref Expression
Assertion fcof ⊢ F : A ⟶ B ∧ Fun ⁡ G → F ∘ G : G -1 A ⟶ B

Proof

Step Hyp Ref Expression
1 df-f ⊢ F : A ⟶ B ↔ F Fn A ∧ ran ⁡ F ⊆ B
2 fncofn ⊢ F Fn A ∧ Fun ⁡ G → F ∘ G Fn G -1 A
3 2 ex ⊢ F Fn A → Fun ⁡ G → F ∘ G Fn G -1 A
4 3 adantr ⊢ F Fn A ∧ ran ⁡ F ⊆ B → Fun ⁡ G → F ∘ G Fn G -1 A
5 rncoss ⊢ ran ⁡ F ∘ G ⊆ ran ⁡ F
6 sstr ⊢ ran ⁡ F ∘ G ⊆ ran ⁡ F ∧ ran ⁡ F ⊆ B → ran ⁡ F ∘ G ⊆ B
7 5 6 mpan ⊢ ran ⁡ F ⊆ B → ran ⁡ F ∘ G ⊆ B
8 7 adantl ⊢ F Fn A ∧ ran ⁡ F ⊆ B → ran ⁡ F ∘ G ⊆ B
9 4 8 jctird ⊢ F Fn A ∧ ran ⁡ F ⊆ B → Fun ⁡ G → F ∘ G Fn G -1 A ∧ ran ⁡ F ∘ G ⊆ B
10 9 imp ⊢ F Fn A ∧ ran ⁡ F ⊆ B ∧ Fun ⁡ G → F ∘ G Fn G -1 A ∧ ran ⁡ F ∘ G ⊆ B
11 1 10 sylanb ⊢ F : A ⟶ B ∧ Fun ⁡ G → F ∘ G Fn G -1 A ∧ ran ⁡ F ∘ G ⊆ B
12 df-f ⊢ F ∘ G : G -1 A ⟶ B ↔ F ∘ G Fn G -1 A ∧ ran ⁡ F ∘ G ⊆ B
13 11 12 sylibr ⊢ F : A ⟶ B ∧ Fun ⁡ G → F ∘ G : G -1 A ⟶ B