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

Theorem rncoeq 5954
Description: Range of a composition. (Contributed by NM, 19-Mar-1998.)
Assertion
Ref Expression
rncoeq (dom 𝐴 = ran 𝐵 → ran (𝐴𝐵) = ran 𝐴)

Proof of Theorem rncoeq
StepHypRef Expression
1 dmcoeq 5953 . 2 (dom 𝐵 = ran 𝐴 → dom (𝐵𝐴) = dom 𝐴)
2 eqcom 2768 . . 3 (dom 𝐴 = ran 𝐵 ↔ ran 𝐵 = dom 𝐴)
3 df-rn 5654 . . . 4 ran 𝐵 = dom 𝐵
4 dfdm4 5867 . . . 4 dom 𝐴 = ran 𝐴
53, 4eqeq12i 2779 . . 3 (ran 𝐵 = dom 𝐴 ↔ dom 𝐵 = ran 𝐴)
62, 5bitri 277 . 2 (dom 𝐴 = ran 𝐵 ↔ dom 𝐵 = ran 𝐴)
7 df-rn 5654 . . . 4 ran (𝐴𝐵) = dom (𝐴𝐵)
8 cnvco 5857 . . . . 5 (𝐴𝐵) = (𝐵𝐴)
98dmeqi 5876 . . . 4 dom (𝐴𝐵) = dom (𝐵𝐴)
107, 9eqtri 2784 . . 3 ran (𝐴𝐵) = dom (𝐵𝐴)
11 df-rn 5654 . . 3 ran 𝐴 = dom 𝐴
1210, 11eqeq12i 2779 . 2 (ran (𝐴𝐵) = ran 𝐴 ↔ dom (𝐵𝐴) = dom 𝐴)
131, 6, 123imtr4i 294 1 (dom 𝐴 = ran 𝐵 → ran (𝐴𝐵) = ran 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1559  ccnv 5642  dom cdm 5643  ran crn 5644  ccom 5647
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654
This theorem is referenced by:  dfdm2  6263  esplysply  33829  algextdeglem4  33978
  Copyright terms: Public domain W3C validator