Metamath Proof Explorer


Theorem elvv

Description: Membership in universal class of ordered pairs. (Contributed by NM, 4-Jul-1994) (Proof shortened by BJ, 16-Oct-2026)

Ref Expression
Assertion elvv ⊢ A ∈ V × V ↔ ∃ x ∃ y A = x y

Proof

Step Hyp Ref Expression
1 elxp2 ⊢ A ∈ V × V ↔ ∃ x ∈ V ∃ y ∈ V A = x y
2 rexv ⊢ ∃ x ∈ V ∃ y ∈ V A = x y ↔ ∃ x ∃ y ∈ V A = x y
3 rexv ⊢ ∃ y ∈ V A = x y ↔ ∃ y A = x y
4 3 exbii ⊢ ∃ x ∃ y ∈ V A = x y ↔ ∃ x ∃ y A = x y
5 1 2 4 3bitri ⊢ A ∈ V × V ↔ ∃ x ∃ y A = x y