Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > scottss | Structured version Visualization version GIF version |
Description: Scott's trick produces a subset of the input class. (Contributed by Rohan Ridenour, 11-Aug-2023.) |
Ref | Expression |
---|---|
scottss | ⊢ Scott 𝐴 ⊆ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-scott 40647 | . 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} | |
2 | 1 | ssrab3 4050 | 1 ⊢ Scott 𝐴 ⊆ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∀wral 3137 ⊆ wss 3929 ‘cfv 6348 rankcrnk 9185 Scott cscott 40646 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-rab 3146 df-in 3936 df-ss 3945 df-scott 40647 |
This theorem is referenced by: elscottab 40655 |
Copyright terms: Public domain | W3C validator |