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

Theorem topnfbey 30831
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 4290 . . 3 ¬ 𝐵 ∈ ∅
2 pnfxr 11269 . . . . . . . 8 +∞ ∈ ℝ*
3 xrltnr 13150 . . . . . . . 8 (+∞ ∈ ℝ* → ¬ +∞ < +∞)
42, 3ax-mp 5 . . . . . . 7 ¬ +∞ < +∞
5 zre 12601 . . . . . . . 8 (+∞ ∈ ℤ → +∞ ∈ ℝ)
6 ltpnf 13151 . . . . . . . 8 (+∞ ∈ ℝ → +∞ < +∞)
75, 6syl 18 . . . . . . 7 (+∞ ∈ ℤ → +∞ < +∞)
84, 7mto 200 . . . . . 6 ¬ +∞ ∈ ℤ
98intnan 491 . . . . 5 ¬ (0 ∈ ℤ ∧ +∞ ∈ ℤ)
10 fzf 13545 . . . . . . 7 ...:(ℤ × ℤ)⟶𝒫 ℤ
1110fdmi 6717 . . . . . 6 dom ... = (ℤ × ℤ)
1211ndmov 7596 . . . . 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 400   = wceq 1569  wcel 2142  c0 4285  𝒫 cpw 4561   class class class wbr 5108   × cxp 5658  (class class class)co 7412  cr 11105  0cc0 11106  +∞cpnf 11246  *cxr 11248   < clt 11249  cz 12597  ...cfz 13541
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-resscn 11163  ax-pre-lttri 11180  ax-pre-lttrn 11181
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-po 5568  df-so 5569  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  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-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-er 8692  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11251  df-mnf 11252  df-xr 11253  df-ltxr 11254  df-neg 11450  df-z 12598  df-fz 13542
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator