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

Theorem ondif1 6500
Description: Two ways to say that  A is a nonzero ordinal number. (Contributed by Mario Carneiro, 21-May-2015.)
Assertion
Ref Expression
ondif1  |-  ( A  e.  ( On  \  1o )  <->  ( A  e.  On  /\  (/)  e.  A
) )

Proof of Theorem ondif1
StepHypRef Expression
1 dif1o 6499 . 2  |-  ( A  e.  ( On  \  1o )  <->  ( A  e.  On  /\  A  =/=  (/) ) )
2 on0eln0 4447 . . 3  |-  ( A  e.  On  ->  ( (/) 
e.  A  <->  A  =/=  (/) ) )
32pm5.32i 618 . 2  |-  ( ( A  e.  On  /\  (/) 
e.  A )  <->  ( A  e.  On  /\  A  =/=  (/) ) )
41, 3bitr4i 243 1  |-  ( A  e.  ( On  \  1o )  <->  ( A  e.  On  /\  (/)  e.  A
) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358    e. wcel 1684    =/= wne 2446    \ cdif 3149   (/)c0 3455   Oncon0 4392   1oc1o 6472
This theorem is referenced by:  cantnflem2  7392  oef1o  7401  cnfcom3  7407  infxpenc  7645
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-tr 4114  df-eprel 4305  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-suc 4398  df-1o 6479
  Copyright terms: Public domain W3C validator