| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onssno | Structured version Visualization version GIF version | ||
| Description: The surreal ordinals are a subclass of the surreals. (Contributed by Scott Fenton, 18-Mar-2025.) |
| Ref | Expression |
|---|---|
| onssno | ⊢ Ons ⊆ No |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ons 28456 | . 2 ⊢ Ons = {𝑥 ∈ No ∣ ( R ‘𝑥) = ∅} | |
| 2 | ssrab2 4033 | . 2 ⊢ {𝑥 ∈ No ∣ ( R ‘𝑥) = ∅} ⊆ No | |
| 3 | 1, 2 | eqsstri 3982 | 1 ⊢ Ons ⊆ No |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 {crab 3415 ⊆ wss 3904 ∅c0 4285 ‘cfv 6536 No csur 27815 R cright 28030 Onscons 28455 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3416 df-ss 3921 df-ons 28456 |
| This theorem is used by: onno 28459 oncutlt 28468 oniso 28475 bdayons 28480 onsfi 28560 |
| Copyright terms: Public domain | W3C validator |