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

Theorem rncoeq 5971
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 5970 . 2 (dom 𝐵 = ran 𝐴 → dom (𝐵𝐴) = dom 𝐴)
2 eqcom 2770 . . 3 (dom 𝐴 = ran 𝐵 ↔ ran 𝐵 = dom 𝐴)
3 df-rn 5672 . . . 4 ran 𝐵 = dom 𝐵
4 dfdm4 5885 . . . 4 dom 𝐴 = ran 𝐴
53, 4eqeq12i 2781 . . 3 (ran 𝐵 = dom 𝐴 ↔ dom 𝐵 = ran 𝐴)
62, 5bitri 278 . 2 (dom 𝐴 = ran 𝐵 ↔ dom 𝐵 = ran 𝐴)
7 df-rn 5672 . . . 4 ran (𝐴𝐵) = dom (𝐴𝐵)
8 cnvco 5875 . . . . 5 (𝐴𝐵) = (𝐵𝐴)
98dmeqi 5894 . . . 4 dom (𝐴𝐵) = dom (𝐵𝐴)
107, 9eqtri 2786 . . 3 ran (𝐴𝐵) = dom (𝐵𝐴)
11 df-rn 5672 . . 3 ran 𝐴 = dom 𝐴
1210, 11eqeq12i 2781 . 2 (ran (𝐴𝐵) = ran 𝐴 ↔ dom (𝐵𝐴) = dom 𝐴)
131, 6, 123imtr4i 295 1 (dom 𝐴 = ran 𝐵 → ran (𝐴𝐵) = ran 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  ccnv 5660  dom cdm 5661  ran crn 5662  ccom 5665
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672
This theorem is referenced by:  dfdm2  6282  esplysply  33961  algextdeglem4  34110
  Copyright terms: Public domain W3C validator