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

Theorem orddisj 4430
Description: An ordinal class and its singleton are disjoint. (Contributed by NM, 19-May-1998.)
Assertion
Ref Expression
orddisj  |-  ( Ord 
A  ->  ( A  i^i  { A } )  =  (/) )

Proof of Theorem orddisj
StepHypRef Expression
1 ordirr 4410 . 2  |-  ( Ord 
A  ->  -.  A  e.  A )
2 disjsn 3693 . 2  |-  ( ( A  i^i  { A } )  =  (/)  <->  -.  A  e.  A )
31, 2sylibr 203 1  |-  ( Ord 
A  ->  ( A  i^i  { A } )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1623    e. wcel 1684    i^i cin 3151   (/)c0 3455   {csn 3640   Ord word 4391
This theorem is referenced by:  orddif  4486  tfrlem10  6403  phplem2  7041  isinf  7076  pssnn  7081  dif1enOLD  7090  dif1en  7091  ackbij1lem5  7850  ackbij1lem14  7859  ackbij1lem16  7861  unsnen  8175  pwfi2f1o  27260
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-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-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-br 4024  df-opab 4078  df-eprel 4305  df-fr 4352  df-we 4354  df-ord 4395
  Copyright terms: Public domain W3C validator