ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  po0 Unicode version

Theorem po0 4408
Description: Any relation is a partial ordering of the empty set. (Contributed by NM, 28-Mar-1997.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
po0  |-  R  Po  (/)

Proof of Theorem po0
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ral0 3596 . 2  |-  A. x  e.  (/)  A. y  e.  (/)  A. z  e.  (/)  ( -.  x R x  /\  ( ( x R y  /\  y R z )  ->  x R z ) )
2 df-po 4393 . 2  |-  ( R  Po  (/)  <->  A. x  e.  (/)  A. y  e.  (/)  A. z  e.  (/)  ( -.  x R x  /\  (
( x R y  /\  y R z )  ->  x R
z ) ) )
31, 2mpbir 146 1  |-  R  Po  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104   A.wral 2510   (/)c0 3494   class class class wbr 4088    Po wpo 4391
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-dif 3202  df-nul 3495  df-po 4393
This theorem is referenced by:  so0  4423
  Copyright terms: Public domain W3C validator