Theorem funcofd 6735

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 6734	. . 3 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹)
3	1, 2	sylib 221	. 2 ⊢ (𝜑 → 𝐹:dom 𝐹⟶ran 𝐹)
4		funcofd.2	. 2 ⊢ (𝜑 → Fun 𝐺)
5		fcof 6726	. 2 ⊢ ((𝐹:dom 𝐹⟶ran 𝐹 ∧ Fun 𝐺) → (𝐹 ∘ 𝐺):(◡𝐺 “ dom 𝐹)⟶ran 𝐹)
6	3, 4, 5	syl2anc 596	1 ⊢ (𝜑 → (𝐹 ∘ 𝐺):(◡𝐺 “ dom 𝐹)⟶ran 𝐹)

This proof depends on syntax axioms:   → wi 4  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658   ∘ ccom 5659  Fun wfun 6527  ⟶wf 6529

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-fun 6535  df-fn 6536  df-f 6537

This theorem is used by:  smfco  47630