Theorem dfdm2 6290

Description: Alternate definition of domain df-dm 5664 that doesn't require dummy variables. (Contributed by NM, 2-Aug-2010.)

Assertion

Ref	Expression
dfdm2	⊢ dom 𝐴 = ∪ ∪ (◡𝐴 ∘ 𝐴)

Proof of Theorem dfdm2

Step	Hyp	Ref	Expression
1		cnvco 5871	. . . . . 6 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ ◡◡𝐴)
2		cocnvcnv2 6266	. . . . . 6 ⊢ (◡𝐴 ∘ ◡◡𝐴) = (◡𝐴 ∘ 𝐴)
3	1, 2	eqtri 2786	. . . . 5 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ 𝐴)
4	3	unieqi 4881	. . . 4 ⊢ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ (◡𝐴 ∘ 𝐴)
5	4	unieqi 4881	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ ∪ (◡𝐴 ∘ 𝐴)
6		unidmrn 6288	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
7	5, 6	eqtr3i 2788	. 2 ⊢ ∪ ∪ (◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
8		df-rn 5665	. . . . 5 ⊢ ran 𝐴 = dom ◡𝐴
9	8	eqcomi 2772	. . . 4 ⊢ dom ◡𝐴 = ran 𝐴
10		dmcoeq 5966	. . . 4 ⊢ (dom ◡𝐴 = ran 𝐴 → dom (◡𝐴 ∘ 𝐴) = dom 𝐴)
11	9, 10	ax-mp 5	. . 3 ⊢ dom (◡𝐴 ∘ 𝐴) = dom 𝐴
12		rncoeq 5967	. . . . 5 ⊢ (dom ◡𝐴 = ran 𝐴 → ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴)
13	9, 12	ax-mp 5	. . . 4 ⊢ ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴
14		dfdm4 5881	. . . 4 ⊢ dom 𝐴 = ran ◡𝐴
15	13, 14	eqtr4i 2789	. . 3 ⊢ ran (◡𝐴 ∘ 𝐴) = dom 𝐴
16	11, 15	uneq12i 4167	. 2 ⊢ (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴)) = (dom 𝐴 ∪ dom 𝐴)
17		unidm 4158	. 2 ⊢ (dom 𝐴 ∪ dom 𝐴) = dom 𝐴
18	7, 16, 17	3eqtrri 2791	1 ⊢ dom 𝐴 = ∪ ∪ (◡𝐴 ∘ 𝐴)

This proof depends on syntax axioms:   = wceq 1569   ∪ cun 4151  ∪ cuni 4869  ^◡ccnv 5653  dom cdm 5654  ran crn 5655   ∘ ccom 5658

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666

This theorem is used by: (None)