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

Theorem nulslts 27792
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 5236 . . 3 ∅ ∈ V
21a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ∈ V)
3 elex 3453 . 2 (𝐴 ∈ 𝒫 No 𝐴 ∈ V)
4 0ss 4335 . . 3 ∅ ⊆ No
54a1i 11 . 2 (𝐴 ∈ 𝒫 No → ∅ ⊆ No )
6 elpwi 4543 . 2 (𝐴 ∈ 𝒫 No 𝐴 No )
7 noel 4273 . . . 4 ¬ 𝑥 ∈ ∅
87pm2.21i 119 . . 3 (𝑥 ∈ ∅ → 𝑥 <s 𝑦)
983ad2ant2 1140 . 2 ((𝐴 ∈ 𝒫 No 𝑥 ∈ ∅ ∧ 𝑦𝐴) → 𝑥 <s 𝑦)
102, 3, 5, 6, 9sltsd 27785 1 (𝐴 ∈ 𝒫 No → ∅ <<s 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2119  Vcvv 3432  wss 3890  c0 4268  𝒫 cpw 4536   class class class wbr 5079   No csur 27628   <s clts 27629   <<s cslts 27774
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-xp 5631  df-slts 27775
This theorem is referenced by:  nulsltsd  27794  bday0  27828  bday0b  27830
  Copyright terms: Public domain W3C validator