Theorem so0 5591

Description: Any relation is a strict ordering of the empty set. (Contributed by NM, 16-Mar-1997.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)

Assertion

Ref	Expression
so0	⊢ 𝑅 Or ∅

Proof of Theorem so0

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

Step	Hyp	Ref	Expression
1		po0 5570	. 2 ⊢ 𝑅 Po ∅
2		ral0 4451	. 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)
3		df-so 5554	. 2 ⊢ (𝑅 Or ∅ ↔ (𝑅 Po ∅ ∧ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
4	1, 2, 3	mpbir2an 721	1 ⊢ 𝑅 Or ∅

Syntax hints:   ∨ w3o 1096  ∀wral 3075  ∅c0 4285   class class class wbr 5099   Po wpo 5551   Or wor 5552

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-ral 3076  df-dif 3907  df-nul 4286  df-po 5553  df-so 5554

This theorem is referenced by:  we0  5640  wemapso2  9498