Theorem we0 5531

Description: Any relation is a well-ordering of the empty set. (Contributed by NM, 16-Mar-1997.)

Assertion

Ref	Expression
we0	⊢ 𝑅 We ∅

Proof of Theorem we0

Step	Hyp	Ref	Expression
1		fr0 5515	. 2 ⊢ 𝑅 Fr ∅
2		so0 5490	. 2 ⊢ 𝑅 Or ∅
3		df-we 5497	. 2 ⊢ (𝑅 We ∅ ↔ (𝑅 Fr ∅ ∧ 𝑅 Or ∅))
4	1, 2, 3	mpbir2an 709	1 ⊢ 𝑅 We ∅

Syntax hints:  ∅c0 4274   Or wor 5454   Fr wfr 5492   We wwe 5494

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3012  df-ral 3138  df-rex 3139  df-rab 3142  df-dif 3922  df-in 3926  df-ss 3935  df-nul 4275  df-po 5455  df-so 5456  df-fr 5495  df-we 5497

This theorem is referenced by:  ord0  6224  cantnf0  9119  cantnf  9137  wemapwe  9141  ltweuz  13314