Metamath Proof Explorer


Theorem scott0bs

Description: Theorem scheme version of scott0b . The collection of all x of minimum rank such that ph ( x ) is true, is not empty iff there is an x such that ph ( x ) holds. (Contributed by NM, 13-Oct-2003) Use the Scott operation. (Revised by BTernaryTau, 22-Jul-2026)

Ref Expression
Assertion scott0bs ⊢ ∃ x φ ↔ Scott x | φ ≠ ∅

Proof

Step Hyp Ref Expression
1 abn0 ⊢ x | φ ≠ ∅ ↔ ∃ x φ
2 scott0b ⊢ x | φ = ∅ ↔ Scott x | φ = ∅
3 2 necon3bii ⊢ x | φ ≠ ∅ ↔ Scott x | φ ≠ ∅
4 1 3 bitr3i ⊢ ∃ x φ ↔ Scott x | φ ≠ ∅