MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dmco Structured version   Visualization version   GIF version

Theorem dmco 6255
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
StepHypRef Expression
1 dfdm4 5877 . 2 dom (𝐴 ∘ 𝐵) = ran ◡(𝐴 ∘ 𝐵)
2 cnvco 5867 . . 3 ◡(𝐴 ∘ 𝐵) = (◡𝐵 ∘ ◡𝐴)
32rneqi 5919 . 2 ran ◡(𝐴 ∘ 𝐵) = ran (◡𝐵 ∘ ◡𝐴)
4 rnco2 6254 . . 3 ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ ran ◡𝐴)
5 dfdm4 5877 . . . 4 dom 𝐴 = ran ◡𝐴
65imaeq2i 6050 . . 3 (◡𝐵 “ dom 𝐴) = (◡𝐵 “ ran ◡𝐴)
74, 6eqtr4i 2787 . 2 ran (◡𝐵 ∘ ◡𝐴) = (◡𝐵 “ dom 𝐴)
81, 3, 73eqtri 2788 1 dom (𝐴 ∘ 𝐵) = (◡𝐵 “ dom 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  ◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654   ∘ ccom 5655
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 2733  ax-sep 5249  ax-pr 5391
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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5657  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664
This theorem is used by:  fncofn  6654  curry1  8113  curry2  8116  smobeth  10664  hashkf  14469  imasless  17705  ofco2  22759  fcoinver  33191  xppreima  33232  smatrcl  34421
  Copyright terms: Public domain W3C validator