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

Theorem 0reno 28689
Description: Surreal zero is a surreal real. (Contributed by Scott Fenton, 15-Apr-2025.)
Assertion
Ref Expression
0reno 0s ∈ ℝs

Proof of Theorem 0reno
Dummy variables 𝑛 𝑥𝑂 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0no 28002 . 2 0s No
2 1nns 28542 . . . 4 1s ∈ ℕs
3 0lt1s 28005 . . . . . 6 0s <s 1s
4 1no 28003 . . . . . . . . 9 1s No
54a1i 11 . . . . . . . 8 (⊤ → 1s No )
65lt0negs2d 28244 . . . . . . 7 (⊤ → ( 0s <s 1s ↔ ( -us ‘ 1s ) <s 0s ))
76mptru 1577 . . . . . 6 ( 0s <s 1s ↔ ( -us ‘ 1s ) <s 0s )
83, 7mpbi 233 . . . . 5 ( -us ‘ 1s ) <s 0s
98, 3pm3.2i 475 . . . 4 (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )
10 fveq2 6881 . . . . . . 7 (𝑛 = 1s → ( -us𝑛) = ( -us ‘ 1s ))
1110breq1d 5119 . . . . . 6 (𝑛 = 1s → (( -us𝑛) <s 0s ↔ ( -us ‘ 1s ) <s 0s ))
12 breq2 5113 . . . . . 6 (𝑛 = 1s → ( 0s <s 𝑛 ↔ 0s <s 1s ))
1311, 12anbi12d 643 . . . . 5 (𝑛 = 1s → ((( -us𝑛) <s 0s ∧ 0s <s 𝑛) ↔ (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )))
1413rspcev 3581 . . . 4 (( 1s ∈ ℕs ∧ (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )) → ∃𝑛 ∈ ℕs (( -us𝑛) <s 0s ∧ 0s <s 𝑛))
152, 9, 14mp2an 704 . . 3 𝑛 ∈ ℕs (( -us𝑛) <s 0s ∧ 0s <s 𝑛)
16 ral0 4459 . . . 4 𝑥𝑂 ∈ ∅ ∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂))
17 left0s 28086 . . . . . . 7 ( L ‘ 0s ) = ∅
18 right0s 28087 . . . . . . 7 ( R ‘ 0s ) = ∅
1917, 18uneq12i 4120 . . . . . 6 (( L ‘ 0s ) ∪ ( R ‘ 0s )) = (∅ ∪ ∅)
20 un0 4351 . . . . . 6 (∅ ∪ ∅) = ∅
2119, 20eqtri 2786 . . . . 5 (( L ‘ 0s ) ∪ ( R ‘ 0s )) = ∅
2221raleqi 3321 . . . 4 (∀𝑥𝑂 ∈ (( L ‘ 0s ) ∪ ( R ‘ 0s ))∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂)) ↔ ∀𝑥𝑂 ∈ ∅ ∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂)))
2316, 22mpbir 234 . . 3 𝑥𝑂 ∈ (( L ‘ 0s ) ∪ ( R ‘ 0s ))∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂))
2415, 23pm3.2i 475 . 2 (∃𝑛 ∈ ℕs (( -us𝑛) <s 0s ∧ 0s <s 𝑛) ∧ ∀𝑥𝑂 ∈ (( L ‘ 0s ) ∪ ( R ‘ 0s ))∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂)))
25 elreno2 28688 . 2 ( 0s ∈ ℝs ↔ ( 0s No ∧ (∃𝑛 ∈ ℕs (( -us𝑛) <s 0s ∧ 0s <s 𝑛) ∧ ∀𝑥𝑂 ∈ (( L ‘ 0s ) ∪ ( R ‘ 0s ))∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂)))))
261, 24, 25mpbir2an 723 1 0s ∈ ℝs
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1570  wtru 1571  wcel 2143  wral 3079  wrex 3089  cun 3903  c0 4286   class class class wbr 5109  cfv 6536  (class class class)co 7410   No csur 27804   <s clts 27805   ≤s cles 27908   0s c0s 27998   1s c1s 27999   L cleft 28018   R cright 28019   -us cnegs 28212   -s csubs 28213   /su cdivs 28380  absscabss 28430  scnns 28506  screno 28682
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606  ax-dc 10425
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-oadd 8453  df-nadd 8648  df-no 27807  df-lts 27808  df-bday 27809  df-les 27909  df-slts 27951  df-cuts 27953  df-0s 28000  df-1s 28001  df-made 28020  df-old 28021  df-left 28023  df-right 28024  df-norec 28131  df-norec2 28142  df-adds 28153  df-negs 28214  df-subs 28215  df-muls 28300  df-divs 28381  df-abss 28431  df-n0s 28507  df-nns 28508  df-reno 28683
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator