Metamath Proof Explorer


Theorem elscottrankss

Description: Relationship between the ranks of an element in a Scott's trick set and an element in the input set. (Contributed by BTernaryTau, 3-Jul-2026)

Ref Expression
Assertion elscottrankss ⊢ A ∈ Scott B ∧ C ∈ B → rank ⁡ A ⊆ rank ⁡ C

Proof

Step Hyp Ref Expression
1 elscott ⊢ A ∈ Scott B ↔ A ∈ B ∧ ∀ x ∈ B rank ⁡ A ⊆ rank ⁡ x
2 1 simprbi ⊢ A ∈ Scott B → ∀ x ∈ B rank ⁡ A ⊆ rank ⁡ x
3 fveq2 ⊢ x = C → rank ⁡ x = rank ⁡ C
4 3 sseq2d ⊢ x = C → rank ⁡ A ⊆ rank ⁡ x ↔ rank ⁡ A ⊆ rank ⁡ C
5 4 rspccva ⊢ ∀ x ∈ B rank ⁡ A ⊆ rank ⁡ x ∧ C ∈ B → rank ⁡ A ⊆ rank ⁡ C
6 2 5 sylan ⊢ A ∈ Scott B ∧ C ∈ B → rank ⁡ A ⊆ rank ⁡ C