Theorem we0 2944

Description: Any relation is a well-ordering of the empty set.

Assertion

Ref	Expression
we0	|- R We (/)

Proof of Theorem we0

Step	Hyp	Ref	Expression
1		df-we 2934	. 2 |- (R We (/) <-> (R Fr (/) /\ R Or (/)))
2		fr0 2927	. 2 |- R Fr (/)
3		so0 2865	. 2 |- R Or (/)
4	1, 2, 3	mpbir2an 730	1 |- R We (/)

Syntax hints:  (/)c0 2280   Or wor 2839   Fr wfr 2915   We wwe 2916

This theorem is referenced by:  ord0 3021

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-po 2840  df-so 2850  df-fr 2917  df-we 2934

Copyright terms: Public domain