MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nulsslt Structured version   Visualization version   GIF version

Theorem nulsslt 27857
Description: The empty set is less-than any set of surreals. (Contributed by Scott Fenton, 8-Dec-2021.)
Assertion
Ref Expression
nulsslt (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴)

Proof of Theorem nulsslt
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 5313 . . 3 ∅ ∈ V
21a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ∈ V)
3 id 22 . 2 (𝐴 ∈ 𝒫 No 𝐴 ∈ 𝒫 No )
4 0ss 4406 . . 3 ∅ ⊆ No
54a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ⊆ No )
6 elpwi 4612 . 2 (𝐴 ∈ 𝒫 No 𝐴 No )
7 noel 4344 . . . 4 ¬ 𝑥 ∈ ∅
87pm2.21i 119 . . 3 (𝑥 ∈ ∅ → 𝑥 <s 𝑦)
983ad2ant2 1133 . 2 ((𝐴 ∈ 𝒫 No 𝑥 ∈ ∅ ∧ 𝑦𝐴) → 𝑥 <s 𝑦)
102, 3, 5, 6, 9ssltd 27851 1 (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2106  Vcvv 3478  wss 3963  c0 4339  𝒫 cpw 4605   class class class wbr 5148   No csur 27699   <s cslt 27700   <<s csslt 27840
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-xp 5695  df-sslt 27841
This theorem is referenced by:  bday0s  27888  bday0b  27890
  Copyright terms: Public domain W3C validator