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

Theorem nulslts 27767
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 5242 . . 3 ∅ ∈ V
21a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ∈ V)
3 elex 3450 . 2 (𝐴 ∈ 𝒫 No 𝐴 ∈ V)
4 0ss 4340 . . 3 ∅ ⊆ No
54a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ⊆ No )
6 elpwi 4548 . 2 (𝐴 ∈ 𝒫 No 𝐴 No )
7 noel 4278 . . . 4 ¬ 𝑥 ∈ ∅
87pm2.21i 119 . . 3 (𝑥 ∈ ∅ → 𝑥 <s 𝑦)
983ad2ant2 1135 . 2 ((𝐴 ∈ 𝒫 No 𝑥 ∈ ∅ ∧ 𝑦𝐴) → 𝑥 <s 𝑦)
102, 3, 5, 6, 9sltsd 27760 1 (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  Vcvv 3429  wss 3889  c0 4273  𝒫 cpw 4541   class class class wbr 5085   No csur 27603   <s clts 27604   <<s cslts 27749
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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-slts 27750
This theorem is referenced by:  nulsltsd  27769  bday0  27803  bday0b  27805
  Copyright terms: Public domain W3C validator