Theorem funcofd 6742

Description: Composition of two functions as a function with domain and codomain. (Contributed by Glauco Siliprandi, 26-Jun-2021.) (Proof shortened by AV, 20-Sep-2024.)

Hypotheses

Ref	Expression
funcofd.1	⊢ (𝜑 → Fun 𝐹)
funcofd.2	⊢ (𝜑 → Fun 𝐺)

Assertion

Ref	Expression
funcofd	⊢ (𝜑 → (𝐹 ∘ 𝐺):(◡𝐺 “ dom 𝐹)⟶ran 𝐹)

Proof of Theorem funcofd

Step	Hyp	Ref	Expression
1		funcofd.1	. . 3 ⊢ (𝜑 → Fun 𝐹)
2		fdmrn 6741	. . 3 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)
3	1, 2	sylib 221	. 2 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ran 𝐹)
4		funcofd.2	. 2 ⊢ (𝜑 → Fun 𝐺)
5		fcof 6733	. 2 ⊢ ((𝐹:dom 𝐹⟶ran 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ 𝐺):(◡𝐺 “ dom 𝐹)⟶ran 𝐹)
6	3, 4, 5	syl2anc 596	1 ⊢ (𝜑 → (𝐹 ∘ 𝐺):(◡𝐺 “ dom 𝐹)⟶ran 𝐹)

This proof depends on syntax axioms:   → wi 4  ^◡ccnv 5662  dom cdm 5663  ran crn 5664   “ cima 5666   ∘ ccom 5667  Fun wfun 6534  ⟶wf 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-fun 6542  df-fn 6543  df-f 6544

This theorem is used by:  smfco  47549