Metamath Proof Explorer


Theorem rextru

Description: Two ways of expressing that a class has at least one element. (Contributed by Zhi Wang, 23-Sep-2024)

Ref Expression
Assertion rextru ⊢ ∃ x x ∈ A ↔ ∃ x ∈ A ⊤

Proof

Step Hyp Ref Expression
1 tru ⊢ ⊤
2 1 biantru ⊢ x ∈ A ↔ x ∈ A ∧ ⊤
3 2 exbii ⊢ ∃ x x ∈ A ↔ ∃ x x ∈ A ∧ ⊤
4 df-rex ⊢ ∃ x ∈ A ⊤ ↔ ∃ x x ∈ A ∧ ⊤
5 3 4 bitr4i ⊢ ∃ x x ∈ A ↔ ∃ x ∈ A ⊤