Metamath Proof Explorer


Theorem rnxp

Description: The range of a Cartesian product. Part of Theorem 3.13(x) of Monk1 p. 37. (Contributed by NM, 12-Apr-2004)

Ref Expression
Assertion rnxp ⊢ A ≠ ∅ → ran ⁡ A × B = B

Proof

Step Hyp Ref Expression
1 df-rn ⊢ ran ⁡ A × B = dom ⁡ A × B -1
2 cnvxp ⊢ A × B -1 = B × A
3 2 dmeqi ⊢ dom ⁡ A × B -1 = dom ⁡ B × A
4 1 3 eqtri ⊢ ran ⁡ A × B = dom ⁡ B × A
5 dmxp ⊢ A ≠ ∅ → dom ⁡ B × A = B
6 4 5 eqtrid ⊢ A ≠ ∅ → ran ⁡ A × B = B