Metamath Proof Explorer


Theorem dfdm2

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

Ref Expression
Assertion dfdm2 ⊢ dom ⁡ A = ⋃ ⋃ A -1 ∘ A

Proof

Step Hyp Ref Expression
1 cnvco ⊢ A -1 ∘ A -1 = A -1 ∘ A -1 -1
2 cocnvcnv2 ⊢ A -1 ∘ A -1 -1 = A -1 ∘ A
3 1 2 eqtri ⊢ A -1 ∘ A -1 = A -1 ∘ A
4 3 unieqi ⊢ ⋃ A -1 ∘ A -1 = ⋃ A -1 ∘ A
5 4 unieqi ⊢ ⋃ ⋃ A -1 ∘ A -1 = ⋃ ⋃ A -1 ∘ A
6 unidmrn ⊢ ⋃ ⋃ A -1 ∘ A -1 = dom ⁡ A -1 ∘ A ∪ ran ⁡ A -1 ∘ A
7 5 6 eqtr3i ⊢ ⋃ ⋃ A -1 ∘ A = dom ⁡ A -1 ∘ A ∪ ran ⁡ A -1 ∘ A
8 dmcocnv1 ⊢ dom ⁡ A -1 ∘ A = dom ⁡ A
9 rncocnv1 ⊢ ran ⁡ A -1 ∘ A = dom ⁡ A
10 8 9 uneq12i ⊢ dom ⁡ A -1 ∘ A ∪ ran ⁡ A -1 ∘ A = dom ⁡ A ∪ dom ⁡ A
11 unidm ⊢ dom ⁡ A ∪ dom ⁡ A = dom ⁡ A
12 7 10 11 3eqtrri ⊢ dom ⁡ A = ⋃ ⋃ A -1 ∘ A