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

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

Proof of Theorem nulslts
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 5252 . . 3 ∅ ∈ V
21a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ∈ V)
3 elex 3461 . 2 (𝐴 ∈ 𝒫 No 𝐴 ∈ V)
4 0ss 4352 . . 3 ∅ ⊆ No
54a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ⊆ No )
6 elpwi 4561 . 2 (𝐴 ∈ 𝒫 No 𝐴 No )
7 noel 4290 . . . 4 ¬ 𝑥 ∈ ∅
87pm2.21i 119 . . 3 (𝑥 ∈ ∅ → 𝑥 <s 𝑦)
983ad2ant2 1134 . 2 ((𝐴 ∈ 𝒫 No 𝑥 ∈ ∅ ∧ 𝑦𝐴) → 𝑥 <s 𝑦)
102, 3, 5, 6, 9sltsd 27764 1 (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2113  Vcvv 3440  wss 3901  c0 4285  𝒫 cpw 4554   class class class wbr 5098   No csur 27607   <s clts 27608   <<s cslts 27753
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-slts 27754
This theorem is referenced by:  nulsltsd  27773  bday0  27807  bday0b  27809
  Copyright terms: Public domain W3C validator