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

Theorem ord0eln0 4769
Description: A nonempty ordinal contains the empty set. (Contributed by NM, 25-Nov-1995.)
Assertion
Ref Expression
ord0eln0  |-  ( Ord 
A  ->  ( (/)  e.  A  <->  A  =/=  (/) ) )

Proof of Theorem ord0eln0
StepHypRef Expression
1 ne0i 3640 . 2  |-  ( (/)  e.  A  ->  A  =/=  (/) )
2 df-ne 2606 . . 3  |-  ( A  =/=  (/)  <->  -.  A  =  (/) )
3 ord0 4767 . . . . 5  |-  Ord  (/)
4 noel 3638 . . . . . 6  |-  -.  A  e.  (/)
5 ordtri2 4750 . . . . . . 7  |-  ( ( Ord  A  /\  Ord  (/) )  ->  ( A  e.  (/)  <->  -.  ( A  =  (/)  \/  (/)  e.  A
) ) )
65con2bid 329 . . . . . 6  |-  ( ( Ord  A  /\  Ord  (/) )  ->  ( ( A  =  (/)  \/  (/)  e.  A
)  <->  -.  A  e.  (/) ) )
74, 6mpbiri 233 . . . . 5  |-  ( ( Ord  A  /\  Ord  (/) )  ->  ( A  =  (/)  \/  (/)  e.  A
) )
83, 7mpan2 666 . . . 4  |-  ( Ord 
A  ->  ( A  =  (/)  \/  (/)  e.  A
) )
98ord 377 . . 3  |-  ( Ord 
A  ->  ( -.  A  =  (/)  ->  (/)  e.  A
) )
102, 9syl5bi 217 . 2  |-  ( Ord 
A  ->  ( A  =/=  (/)  ->  (/)  e.  A
) )
111, 10impbid2 204 1  |-  ( Ord 
A  ->  ( (/)  e.  A  <->  A  =/=  (/) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    = wceq 1364    e. wcel 1761    =/= wne 2604   (/)c0 3634   Ord word 4714
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-9 1765  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422  ax-sep 4410  ax-nul 4418  ax-pr 4528
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 961  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-eu 2261  df-mo 2262  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ne 2606  df-ral 2718  df-rex 2719  df-rab 2722  df-v 2972  df-sbc 3184  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-pss 3341  df-nul 3635  df-if 3789  df-pw 3859  df-sn 3875  df-pr 3877  df-op 3881  df-uni 4089  df-br 4290  df-opab 4348  df-tr 4383  df-eprel 4628  df-po 4637  df-so 4638  df-fr 4675  df-we 4677  df-ord 4718
This theorem is referenced by:  on0eln0  4770  dflim2  4771  0ellim  4777  0elsuc  6445  ordge1n0  6934  omwordi  7006  omass  7015  nnmord  7067  nnmwordi  7070  wemapwe  7924  wemapweOLD  7925  elni2  9042  bnj529  31567
  Copyright terms: Public domain W3C validator