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

Theorem topnfbey 30950
Description: Nothing seems to be impossible to Prof. Lirpa. After years of intensive research, he managed to find a proof that when given a chance to reach infinity, one could indeed go beyond, thus giving formal soundness to Buzz Lightyear's motto "To infinity... and beyond!" (Contributed by Prof. Loof Lirpa, 1-Apr-2020.) (Revised by Thierry Arnoux, 2-Aug-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
topnfbey (𝐵 ∈ (0...+∞) → +∞ < 𝐵)

Proof of Theorem topnfbey
StepHypRef Expression
1 noel 4287 . . 3 ¬ 𝐵 ∈ ∅
2 pnfxr 11290 . . . . . . . 8 +∞ ∈ ℝ*
3 xrltnr 13172 . . . . . . . 8 (+∞ ∈ ℝ* → ¬ +∞ < +∞)
42, 3ax-mp 5 . . . . . . 7 ¬ +∞ < +∞
5 zre 12622 . . . . . . . 8 (+∞ ∈ ℤ → +∞ ∈ ℝ)
6 ltpnf 13173 . . . . . . . 8 (+∞ ∈ ℝ → +∞ < +∞)
75, 6syl 18 . . . . . . 7 (+∞ ∈ ℤ → +∞ < +∞)
84, 7mto 200 . . . . . 6 ¬ +∞ ∈ ℤ
98intnan 492 . . . . 5 ¬ (0 ∈ ℤ ∧ +∞ ∈ ℤ)
10 fzf 13567 . . . . . . 7 ...:(ℤ × ℤ)⟶𝒫 ℤ
1110fdmi 6718 . . . . . 6 dom ... = (ℤ × ℤ)
1211ndmov 7601 . . . . 5 (¬ (0 ∈ ℤ ∧ +∞ ∈ ℤ) → (0...+∞) = ∅)
139, 12ax-mp 5 . . . 4 (0...+∞) = ∅
1413eleq2i 2854 . . 3 (𝐵 ∈ (0...+∞) ↔ 𝐵 ∈ ∅)
151, 14mtbir 326 . 2 ¬ 𝐵 ∈ (0...+∞)
1615pm2.21i 120 1 (𝐵 ∈ (0...+∞) → +∞ < 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wcel 2145  c0 4282  𝒫 cpw 4560   class class class wbr 5107   × cxp 5657  (class class class)co 7416  cr 11126  0cc0 11127  +∞cpnf 11267  *cxr 11269   < clt 11270  cz 12618  ...cfz 13563
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-pre-lttri 11201  ax-pre-lttrn 11202
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-neg 11471  df-z 12619  df-fz 13564
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator