Theorem scottss 44694

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 44687	. 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)}
2	1	ssrab3 4020	1 ⊢ Scott 𝐴 ⊆ 𝐴

Syntax hints:  ∀wral 3054   ⊆ wss 3890  ‘cfv 6492  rankcrnk 9685  Scott cscott 44686

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712

This theorem depends on definitions:  df-bi 208  df-an 397  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-rab 3393  df-ss 3907  df-scott 44687

This theorem is referenced by:  elscottab  44695