Theorem dmco 6251

Description: The domain of a composition. Exercise 27 of [Enderton] p. 53. (Contributed by NM, 4-Feb-2004.)

Assertion

Ref	Expression
dmco	⊢ dom (𝐴 ∘ 𝐵) = (◡𝐵 “ dom 𝐴)

Proof of Theorem dmco

Step	Hyp	Ref	Expression
1		dfdm4 5879	. 2 ⊢ dom (𝐴 ∘ 𝐵) = ran ◡(𝐴 ∘ 𝐵)
2		cnvco 5869	. . 3 ⊢ ◡(𝐴 ∘ 𝐵) = (◡𝐵 ∘ ◡𝐴)
3	2	rneqi 5921	. 2 ⊢ ran ◡(𝐴 ∘ 𝐵) = ran (◡𝐵 ∘ ◡𝐴)
4		rnco2 6250	. . 3 ⊢ ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ ran ◡𝐴)
5		dfdm4 5879	. . . 4 ⊢ dom 𝐴 = ran ◡𝐴
6	5	imaeq2i 6054	. . 3 ⊢ (◡𝐵 “ dom 𝐴) = (◡𝐵 “ ran ◡𝐴)
7	4, 6	eqtr4i 2786	. 2 ⊢ ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ dom 𝐴)
8	1, 3, 7	3eqtri 2787	1 ⊢ dom (𝐴 ∘ 𝐵) = (◡𝐵 “ dom 𝐴)

This proof depends on syntax axioms:   = wceq 1570  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658   ∘ ccom 5659

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-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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  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-xp 5661  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668

This theorem is used by:  fncofn  6649  curry1  8101  curry2  8104  smobeth  10595  hashkf  14396  imasless  17626  ofco2  22673  fcoinver  33077  xppreima  33118  smatrcl  34306