MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ondif1 Unicode version

Theorem ondif1 7170
Description: Two ways to say that is a nonzero ordinal number. (Contributed by Mario Carneiro, 21-May-2015.)
Assertion
Ref Expression
ondif1

Proof of Theorem ondif1
StepHypRef Expression
1 dif1o 7169 . 2
2 on0eln0 4938 . . 3
32pm5.32i 637 . 2
41, 3bitr4i 252 1
Colors of variables: wff setvar class
Syntax hints:  <->wb 184  /\wa 369  e.wcel 1818  =/=wne 2652  \cdif 3472   c0 3784   con0 4883   c1o 7142
This theorem is referenced by:  cantnflem2  8130  oef1o  8162  oef1oOLD  8163  cnfcom3  8169  cnfcom3OLD  8177  infxpenc  8416  infxpencOLD  8421
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-9 1822  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435  ax-sep 4573  ax-nul 4581  ax-pr 4691
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-eu 2286  df-mo 2287  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-pss 3491  df-nul 3785  df-if 3942  df-pw 4014  df-sn 4030  df-pr 4032  df-op 4036  df-uni 4250  df-br 4453  df-opab 4511  df-tr 4546  df-eprel 4796  df-po 4805  df-so 4806  df-fr 4843  df-we 4845  df-ord 4886  df-on 4887  df-suc 4889  df-1o 7149
  Copyright terms: Public domain W3C validator