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

Theorem orddisj 6345
Description: An ordinal class and its singleton are disjoint. (Contributed by NM, 19-May-1998.)
Assertion
Ref Expression
orddisj (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)

Proof of Theorem orddisj
StepHypRef Expression
1 ordirr 6325 . 2 (Ord 𝐴 → ¬ 𝐴𝐴)
2 disjsn 4663 . 2 ((𝐴 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴𝐴)
31, 2sylibr 234 1 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  cin 3902  c0 4284  {csn 4577  Ord word 6306
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-br 5093  df-opab 5155  df-eprel 5519  df-fr 5572  df-we 5574  df-ord 6310
This theorem is referenced by:  orddif  6405  omsucne  7818  tfrlem10  8309  enrefnn  8972  pssnn  9082  unfi  9085  isinf  9154  dif1ennnALT  9166  ackbij1lem5  10117  ackbij1lem14  10126  ackbij1lem16  10128  unsnen  10447  pwfi2f1o  43069
  Copyright terms: Public domain W3C validator