Metamath Proof Explorer


Theorem reldm

Description: An expression for the domain of a relation. (Contributed by NM, 22-Sep-2013) (Proof shortened by Sky Winter, 22-Oct-2026)

Ref Expression
Assertion reldm ⊢ Rel ⁡ A → dom ⁡ A = ran ⁡ x ∈ A ⟼ 1 st ⁡ x

Proof

Step Hyp Ref Expression
1 releldm2 ⊢ Rel ⁡ A → y ∈ dom ⁡ A ↔ ∃ x ∈ A 1 st ⁡ x = y
2 eqid ⊢ x ∈ A ⟼ 1 st ⁡ x = x ∈ A ⟼ 1 st ⁡ x
3 fvex ⊢ 1 st ⁡ x ∈ V
4 2 3 elrnmpti ⊢ y ∈ ran ⁡ x ∈ A ⟼ 1 st ⁡ x ↔ ∃ x ∈ A y = 1 st ⁡ x
5 eqcom ⊢ y = 1 st ⁡ x ↔ 1 st ⁡ x = y
6 5 rexbii ⊢ ∃ x ∈ A y = 1 st ⁡ x ↔ ∃ x ∈ A 1 st ⁡ x = y
7 4 6 bitri ⊢ y ∈ ran ⁡ x ∈ A ⟼ 1 st ⁡ x ↔ ∃ x ∈ A 1 st ⁡ x = y
8 1 7 bitr4di ⊢ Rel ⁡ A → y ∈ dom ⁡ A ↔ y ∈ ran ⁡ x ∈ A ⟼ 1 st ⁡ x
9 8 eqrdv ⊢ Rel ⁡ A → dom ⁡ A = ran ⁡ x ∈ A ⟼ 1 st ⁡ x