HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem orddisj 2985
Description: An ordinal class and its singleton are disjoint.
Assertion
Ref Expression
orddisj |- (Ord A -> (A i^i {A}) = (/))

Proof of Theorem orddisj
StepHypRef Expression
1 ordirr 2966 . 2 |- (Ord A -> -. A e. A)
2 disjsn 2441 . 2 |- ((A i^i {A}) = (/) <-> -. A e. A)
31, 2sylibr 200 1 |- (Ord A -> (A i^i {A}) = (/))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   = wceq 956   e. wcel 958   i^i cin 2046  (/)c0 2280  {csn 2409  Ord word 2947
This theorem is referenced by:  orddif 3075  tfrlem10 3920  phplem2 4509  pssnn 4534  fodomfiOLD 4566  cda1en 4926
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-eprel 2832  df-fr 2917  df-we 2934  df-ord 2951
Copyright terms: Public domain