Theorem dfdm2 6284

Description: Alternate definition of domain df-dm 5661 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 5867	. . . . . 6 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ ◡◡𝐴)
2		cocnvcnv2 6260	. . . . . 6 ⊢ (◡𝐴 ∘ ◡◡𝐴) = (◡𝐴 ∘ 𝐴)
3	1, 2	eqtri 2784	. . . . 5 ⊢ ◡(◡𝐴 ∘ 𝐴) = (◡𝐴 ∘ 𝐴)
4	3	unieqi 4879	. . . 4 ⊢ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ (◡𝐴 ∘ 𝐴)
5	4	unieqi 4879	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = ∪ ∪ (◡𝐴 ∘ 𝐴)
6		unidmrn 6282	. . 3 ⊢ ∪ ∪ ◡(◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
7	5, 6	eqtr3i 2786	. 2 ⊢ ∪ ∪ (◡𝐴 ∘ 𝐴) = (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴))
8		df-rn 5662	. . . . 5 ⊢ ran 𝐴 = dom ◡𝐴
9	8	eqcomi 2770	. . . 4 ⊢ dom ◡𝐴 = ran 𝐴
10		dmcoeq 5962	. . . 4 ⊢ (dom ◡𝐴 = ran 𝐴 → dom (◡𝐴 ∘ 𝐴) = dom 𝐴)
11	9, 10	ax-mp 5	. . 3 ⊢ dom (◡𝐴 ∘ 𝐴) = dom 𝐴
12		rncoeq 5963	. . . . 5 ⊢ (dom ◡𝐴 = ran 𝐴 → ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴)
13	9, 12	ax-mp 5	. . . 4 ⊢ ran (◡𝐴 ∘ 𝐴) = ran ◡𝐴
14		dfdm4 5877	. . . 4 ⊢ dom 𝐴 = ran ◡𝐴
15	13, 14	eqtr4i 2787	. . 3 ⊢ ran (◡𝐴 ∘ 𝐴) = dom 𝐴
16	11, 15	uneq12i 4113	. 2 ⊢ (dom (◡𝐴 ∘ 𝐴) ∪ ran (◡𝐴 ∘ 𝐴)) = (dom 𝐴 ∪ dom 𝐴)
17		unidm 4104	. 2 ⊢ (dom 𝐴 ∪ dom 𝐴) = dom 𝐴
18	7, 16, 17	3eqtrri 2789	1 ⊢ dom 𝐴 = ∪ ∪ (◡𝐴 ∘ 𝐴)

This proof depends on syntax axioms:   = wceq 1570   ∪ cun 3897  ∪ cuni 4867  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   ∘ ccom 5655

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663

This theorem is used by: (None)