Metamath Proof Explorer


Theorem elpreqprb

Description: A set is an element of an unordered pair iff there is another (maybe the same) set which is an element of the unordered pair. (Proposed by BJ, 8-Dec-2020.) (Contributed by AV, 9-Dec-2020)

Ref Expression
Assertion elpreqprb ⊢ A ∈ V → A ∈ B C ↔ ∃ x B C = A x

Proof

Step Hyp Ref Expression
1 elpreqpr ⊢ A ∈ B C → ∃ x B C = A x
2 prid1g ⊢ A ∈ V → A ∈ A x
3 eleq2 ⊢ B C = A x → A ∈ B C ↔ A ∈ A x
4 2 3 syl5ibrcom ⊢ A ∈ V → B C = A x → A ∈ B C
5 4 exlimdv ⊢ A ∈ V → ∃ x B C = A x → A ∈ B C
6 1 5 impbid2 ⊢ A ∈ V → A ∈ B C ↔ ∃ x B C = A x