Metamath Proof Explorer


Theorem en1eqsnbi

Description: A set containing an element has exactly one element iff it is a singleton. Formerly part of proof for rngen1zr . (Contributed by FL, 13-Feb-2010) (Revised by AV, 25-Jan-2020)

Ref Expression
Assertion en1eqsnbi ⊢ A ∈ B → B ≈ 1 𝑜 ↔ B = A

Proof

Step Hyp Ref Expression
1 en1eqsn ⊢ A ∈ B ∧ B ≈ 1 𝑜 → B = A
2 1 ex ⊢ A ∈ B → B ≈ 1 𝑜 → B = A
3 ensn1g ⊢ A ∈ B → A ≈ 1 𝑜
4 breq1 ⊢ B = A → B ≈ 1 𝑜 ↔ A ≈ 1 𝑜
5 3 4 syl5ibrcom ⊢ A ∈ B → B = A → B ≈ 1 𝑜
6 2 5 impbid ⊢ A ∈ B → B ≈ 1 𝑜 ↔ B = A