Theorem po0 5248

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	⊢ 𝑅 Po ∅

Proof of Theorem po0

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ral0 4269	. 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2		df-po 5233	. 2 ⊢ (𝑅 Po ∅ ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
3	1, 2	mpbir 223	1 ⊢ 𝑅 Po ∅

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 385  ∀wral 3089  ∅c0 4115   class class class wbr 4843   Po wpo 5231

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-ext 2777

This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-v 3387  df-dif 3772  df-nul 4116  df-po 5233

This theorem is referenced by:  so0  5266  posn  5392  dfpo2  32159  ipo0  39433