Theorem po0 5185

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 4215	. 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2		df-po 5170	. 2 ⊢ (𝑅 Po ∅ ↔ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
3	1, 2	mpbir 221	1 ⊢ 𝑅 Po ∅

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 382  ∀wral 3060  ∅c0 4061   class class class wbr 4784   Po wpo 5168

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ral 3065  df-v 3351  df-dif 3724  df-nul 4062  df-po 5170

This theorem is referenced by:  so0  5203  posn  5327  dfpo2  31977  ipo0  39172