| 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 28515 | . 2 ⊢ Ons = {𝑥 ∈ No ∣ ( R ‘𝑥) = ∅} | |
| 2 | ssrab2 4031 | . 2 ⊢ {𝑥 ∈ No ∣ ( R ‘𝑥) = ∅} ⊆ No | |
| 3 | 1, 2 | eqsstri 3980 | 1 ⊢ Ons ⊆ No |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 {crab 3414 ⊆ wss 3902 ∅c0 4282 ‘cfv 6537 No csur 27874 R cright 28089 Onscons 28514 |
| 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 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-ss 3919 df-ons 28515 |
| This theorem is used by: onno 28518 oncutlt 28527 oniso 28534 bdayons 28539 onsfi 28619 |
| Copyright terms: Public domain | W3C validator |