Theorem scottss 9874

Description: Scott's trick produces a subset of the input class. (Contributed by Rohan Ridenour, 11-Aug-2023.)

Assertion

Ref	Expression
scottss	⊢ Scott 𝐴 ⊆ 𝐴

Proof of Theorem scottss

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-scott 9868	. 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
2	1	ssrab3 4039	1 ⊢ Scott 𝐴 ⊆ 𝐴

This proof depends on syntax axioms:  ∀wral 3082   ⊆ wss 3908  ‘cfv 6543  rankcrnk 9745  Scott cscott 9867

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-ss 3925  df-scott 9868

This theorem is used by:  scott0  9875  elscottab  9881  cplem1  9889  hta  9901