Theorem rncoeq 5977

Description: Range of a composition. (Contributed by NM, 19-Mar-1998.)

Assertion

Ref	Expression
rncoeq	⊢ (dom 𝐴 = ran 𝐵 → ran (𝐴 ∘ 𝐵) = ran 𝐴)

Proof of Theorem rncoeq

Step	Hyp	Ref	Expression
1		dmcoeq 5974	. 2 ⊢ (dom ◡𝐵 = ran ◡𝐴 → dom (◡𝐵 ∘ ◡𝐴) = dom ◡𝐴)
2		eqcom 2770	. . 3 ⊢ (dom 𝐴 = ran 𝐵 ↔ ran 𝐵 = dom 𝐴)
3		df-rn 5669	. . . 4 ⊢ ran 𝐵 = dom ◡𝐵
4		dfdm4 5889	. . . 4 ⊢ dom 𝐴 = ran ◡𝐴
5	3, 4	eqeq12i 2781	. . 3 ⊢ (ran 𝐵 = dom 𝐴 ↔ dom ◡𝐵 = ran ◡𝐴)
6	2, 5	bitri 278	. 2 ⊢ (dom 𝐴 = ran 𝐵 ↔ dom ◡𝐵 = ran ◡𝐴)
7		df-rn 5669	. . . 4 ⊢ ran (𝐴 ∘ 𝐵) = dom ◡(𝐴 ∘ 𝐵)
8		cnvco 5879	. . . . 5 ⊢ ◡(𝐴 ∘ 𝐵) = (◡𝐵 ∘ ◡𝐴)
9	8	dmeqi 5898	. . . 4 ⊢ dom ◡(𝐴 ∘ 𝐵) = dom (◡𝐵 ∘ ◡𝐴)
10	7, 9	eqtri 2786	. . 3 ⊢ ran (𝐴 ∘ 𝐵) = dom (◡𝐵 ∘ ◡𝐴)
11		df-rn 5669	. . 3 ⊢ ran 𝐴 = dom ◡𝐴
12	10, 11	eqeq12i 2781	. 2 ⊢ (ran (𝐴 ∘ 𝐵) = ran 𝐴 ↔ dom (◡𝐵 ∘ ◡𝐴) = dom ◡𝐴)
13	1, 6, 12	3imtr4i 295	1 ⊢ (dom 𝐴 = ran 𝐵 → ran (𝐴 ∘ 𝐵) = ran 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  ^◡ccnv 5657  dom cdm 5658  ran crn 5659   ∘ ccom 5662

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669

This theorem is used by:  rncocnv2  5978  rncocnv1  5979  esplysply  34314  algextdeglem4  34463