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

Theorem 0reno 28875
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 28188 . 2 0s ∈ No
2 1nns 28728 . . . 4 1s ∈ ℕs
3 0lt1s 28191 . . . . . 6 0s <s 1s
4 1no 28189 . . . . . . . . 9 1s ∈ No
54a1i 11 . . . . . . . 8 (⊤ → 1s ∈ No )
65lt0negs2d 28430 . . . . . . 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 476 . . . 4 (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )
10 fveq2 6883 . . . . . . 7 (𝑛 = 1s → ( -us ‘𝑛) = ( -us ‘ 1s ))
1110breq1d 5113 . . . . . 6 (𝑛 = 1s → (( -us ‘𝑛) <s 0s ↔ ( -us ‘ 1s ) <s 0s ))
12 breq2 5107 . . . . . 6 (𝑛 = 1s → ( 0s <s 𝑛 ↔ 0s <s 1s ))
1311, 12anbi12d 644 . . . . 5 (𝑛 = 1s → ((( -us ‘𝑛) <s 0s ∧ 0s <s 𝑛) ↔ (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )))
1413rspcev 3577 . . . 4 (( 1s ∈ ℕs ∧ (( -us ‘ 1s ) <s 0s ∧ 0s <s 1s )) → ∃𝑛 ∈ ℕs (( -us ‘𝑛) <s 0s ∧ 0s <s 𝑛))
152, 9, 14mp2an 705 . . 3 ∃𝑛 ∈ ℕs (( -us ‘𝑛) <s 0s ∧ 0s <s 𝑛)
16 ral0 4454 . . . 4 ∀𝑥𝑂 ∈ ∅ ∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂))
17 left0s 28272 . . . . . . 7 ( L ‘ 0s ) = ∅
18 right0s 28273 . . . . . . 7 ( R ‘ 0s ) = ∅
1917, 18uneq12i 4113 . . . . . 6 (( L ‘ 0s ) ∪ ( R ‘ 0s )) = (∅ ∪ ∅)
20 un0 4344 . . . . . 6 (∅ ∪ ∅) = ∅
2119, 20eqtri 2784 . . . . 5 (( L ‘ 0s ) ∪ ( R ‘ 0s )) = ∅
2221raleqi 3318 . . . 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 476 . 2 (∃𝑛 ∈ ℕs (( -us ‘𝑛) <s 0s ∧ 0s <s 𝑛) ∧ ∀𝑥𝑂 ∈ (( L ‘ 0s ) ∪ ( R ‘ 0s ))∃𝑛 ∈ ℕs ( 1s /su 𝑛) ≤s (abss‘( 0s -s 𝑥𝑂)))
25 elreno2 28874 . 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 724 1 0s ∈ ℝs
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ⊤wtru 1571   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ∪ cun 3897  ∅c0 4279   class class class wbr 5103  ‘cfv 6537  (class class class)co 7418   No csur 27990   <s clts 27991   ≤s cles 28094   0s c0s 28184   1s c1s 28185   L cleft 28204   R cright 28205   -us cnegs 28398   -s csubs 28399   /su cdivs 28566  absscabss 28616  ℕscnns 28692  ℝscreno 28868
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635  ax-dc 10517
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-2o 8470  df-oadd 8473  df-nadd 8668  df-no 27993  df-lts 27994  df-bday 27995  df-les 28095  df-slts 28137  df-cuts 28139  df-0s 28186  df-1s 28187  df-made 28206  df-old 28207  df-left 28209  df-right 28210  df-norec 28317  df-norec2 28328  df-adds 28339  df-negs 28400  df-subs 28401  df-muls 28486  df-divs 28567  df-abss 28617  df-n0s 28693  df-nns 28694  df-reno 28869
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator