| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nulslts | Structured version Visualization version GIF version | ||
| Description: The empty set is less-than any set of surreals. (Contributed by Scott Fenton, 8-Dec-2021.) |
| Ref | Expression |
|---|---|
| nulslts | ⊢ (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ex 5254 | . . 3 ⊢ ∅ ∈ V | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝒫 No → ∅ ∈ V) |
| 3 | elex 3463 | . 2 ⊢ (𝐴 ∈ 𝒫 No → 𝐴 ∈ V) | |
| 4 | 0ss 4354 | . . 3 ⊢ ∅ ⊆ No | |
| 5 | 4 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝒫 No → ∅ ⊆ No ) |
| 6 | elpwi 4563 | . 2 ⊢ (𝐴 ∈ 𝒫 No → 𝐴 ⊆ No ) | |
| 7 | noel 4292 | . . . 4 ⊢ ¬ 𝑥 ∈ ∅ | |
| 8 | 7 | pm2.21i 119 | . . 3 ⊢ (𝑥 ∈ ∅ → 𝑥 <s 𝑦) |
| 9 | 8 | 3ad2ant2 1135 | . 2 ⊢ ((𝐴 ∈ 𝒫 No ∧ 𝑥 ∈ ∅ ∧ 𝑦 ∈ 𝐴) → 𝑥 <s 𝑦) |
| 10 | 2, 3, 5, 6, 9 | sltsd 27776 | 1 ⊢ (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2114 Vcvv 3442 ⊆ wss 3903 ∅c0 4287 𝒫 cpw 4556 class class class wbr 5100 No csur 27619 <s clts 27620 <<s cslts 27765 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-slts 27766 |
| This theorem is referenced by: nulsltsd 27785 bday0 27819 bday0b 27821 |
| Copyright terms: Public domain | W3C validator |