Metamath Proof Explorer


Theorem pren2

Description: An unordered pair is equinumerous to ordinal two iff both parts are sets not equal to each other. (Contributed by RP, 8-Oct-2023)

Ref Expression
Assertion pren2 ⊢ A B ≈ 2 𝑜 ↔ A ∈ V ∧ B ∈ V ∧ A ≠ B

Proof

Step Hyp Ref Expression
1 pr2ne ⊢ A ∈ V ∧ B ∈ V → A B ≈ 2 𝑜 ↔ A ≠ B
2 1 pm5.32i ⊢ A ∈ V ∧ B ∈ V ∧ A B ≈ 2 𝑜 ↔ A ∈ V ∧ B ∈ V ∧ A ≠ B
3 pr2cv ⊢ A B ≈ 2 𝑜 → A ∈ V ∧ B ∈ V
4 3 pm4.71ri ⊢ A B ≈ 2 𝑜 ↔ A ∈ V ∧ B ∈ V ∧ A B ≈ 2 𝑜
5 df-3an ⊢ A ∈ V ∧ B ∈ V ∧ A ≠ B ↔ A ∈ V ∧ B ∈ V ∧ A ≠ B
6 2 4 5 3bitr4i ⊢ A B ≈ 2 𝑜 ↔ A ∈ V ∧ B ∈ V ∧ A ≠ B