Theorem dfdm2 6240

Description: Alternate definition of domain df-dm 5635 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 5835	. . . . . 6 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ ◡◡𝐴)
2		cocnvcnv2 6218	. . . . . 6 ⊢ (◡𝐴 ∘ ◡◡𝐴) = (◡𝐴 ∘ 𝐴)
3	1, 2	eqtri 2760	. . . . 5 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ 𝐴)
4	3	unieqi 4863	. . . 4 ⊢ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ (◡𝐴 ∘ 𝐴)
5	4	unieqi 4863	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ ∪ (◡𝐴 ∘ 𝐴)
6		unidmrn 6238	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
7	5, 6	eqtr3i 2762	. 2 ⊢ ∪ ∪ (◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
8		df-rn 5636	. . . . 5 ⊢ ran 𝐴 = dom ◡𝐴
9	8	eqcomi 2746	. . . 4 ⊢ dom ◡𝐴 = ran 𝐴
10		dmcoeq 5931	. . . 4 ⊢ (dom ◡𝐴 = ran 𝐴 → dom (◡𝐴 ∘ 𝐴) = dom 𝐴)
11	9, 10	ax-mp 5	. . 3 ⊢ dom (◡𝐴 ∘ 𝐴) = dom 𝐴
12		rncoeq 5932	. . . . 5 ⊢ (dom ◡𝐴 = ran 𝐴 → ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴)
13	9, 12	ax-mp 5	. . . 4 ⊢ ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴
14		dfdm4 5845	. . . 4 ⊢ dom 𝐴 = ran ◡𝐴
15	13, 14	eqtr4i 2763	. . 3 ⊢ ran (◡𝐴 ∘ 𝐴) = dom 𝐴
16	11, 15	uneq12i 4107	. 2 ⊢ (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴)) = (dom 𝐴 ∪ dom 𝐴)
17		unidm 4098	. 2 ⊢ (dom 𝐴 ∪ dom 𝐴) = dom 𝐴
18	7, 16, 17	3eqtrri 2765	1 ⊢ dom 𝐴 = ∪ ∪ (◡𝐴 ∘ 𝐴)

Syntax hints:   = wceq 1542   ∪ cun 3888  ∪ cuni 4851  ^◡ccnv 5624  dom cdm 5625  ran crn 5626   ∘ ccom 5629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5232  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637

This theorem is referenced by: (None)