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 40662 | . 2 ⊢ Scott 𝐴 = {𝑥 ∈ 𝐴 ∣ ∀𝑦 ∈ 𝐴 (rank‘𝑥) ⊆ (rank‘𝑦)} | |
2 | 1 | ssrab3 4045 | 1 ⊢ Scott 𝐴 ⊆ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∀wral 3138 ⊆ wss 3924 ‘cfv 6341 rankcrnk 9178 Scott cscott 40661 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-in 3931 df-ss 3940 df-scott 40662 |
This theorem is referenced by: elscottab 40670 |
Copyright terms: Public domain | W3C validator |