Theorem po0 4767

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.

Step	Hyp	Ref	Expression
1		ral0 3895	. 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 4752	. 2 |- ( R Po (/) <-> A. x e. (/) A. y e. (/) A. z e. (/) ( -. x R x /\ ( ( x R y /\ y R z ) -> x R z ) ) )
3	1, 2	mpbir 209	1 |- R Po (/)

Syntax hints:   -. wn 3   -> wi 4   /\ wa 369   A.wral 2799   (/)c0 3748   class class class wbr 4403   Po wpo 4750

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432

This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ral 2804  df-v 3080  df-dif 3442  df-nul 3749  df-po 4752

This theorem is referenced by:  so0  4785  posn  5018  dfpo2  27729  ipo0  29873