Theorem so0 5567

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 5546	. 2 ⊢ 𝑅 Po ∅
2		ral0 4429	. 2 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)
3		df-so 5530	. 2 ⊢ (𝑅 Or ∅ ↔ (𝑅 Po ∅ ∧ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
4	1, 2, 3	mpbir2an 718	1 ⊢ 𝑅 Or ∅

Syntax hints:   ∨ w3o 1092  ∀wral 3055  ∅c0 4264   class class class wbr 5075   Po wpo 5527   Or wor 5528

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-ral 3056  df-dif 3888  df-nul 4265  df-po 5529  df-so 5530

This theorem is referenced by:  we0  5616  wemapso2  9462