Metamath Proof Explorer


Theorem rankscott

Description: The rank of a nonempty Scott's trick set. (Contributed by BTernaryTau, 8-Jul-2026)

Ref Expression
Assertion rankscott ⊢ A ≠ ∅ → rank ⁡ Scott A = suc ⁡ ⋂ rank A

Proof

Step Hyp Ref Expression
1 scott0b ⊢ A = ∅ ↔ Scott A = ∅
2 1 necon3bii ⊢ A ≠ ∅ ↔ Scott A ≠ ∅
3 n0 ⊢ Scott A ≠ ∅ ↔ ∃ x x ∈ Scott A
4 2 3 sylbb ⊢ A ≠ ∅ → ∃ x x ∈ Scott A
5 id ⊢ x ∈ Scott A → x ∈ Scott A
6 5 scottrankd ⊢ x ∈ Scott A → rank ⁡ Scott A = suc ⁡ rank ⁡ x
7 elscottrank ⊢ x ∈ Scott A → rank ⁡ x = ⋂ rank A
8 7 suceqd ⊢ x ∈ Scott A → suc ⁡ rank ⁡ x = suc ⁡ ⋂ rank A
9 6 8 eqtrd ⊢ x ∈ Scott A → rank ⁡ Scott A = suc ⁡ ⋂ rank A
10 9 exlimiv ⊢ ∃ x x ∈ Scott A → rank ⁡ Scott A = suc ⁡ ⋂ rank A
11 4 10 syl ⊢ A ≠ ∅ → rank ⁡ Scott A = suc ⁡ ⋂ rank A