Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > we0 | Unicode version |
Description: Any relation is a well-ordering of the empty set. (Contributed by NM, 16-Mar-1997.) |
Ref | Expression |
---|---|
we0 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fr0 4243 | . 2 | |
2 | ral0 3434 | . 2 | |
3 | df-wetr 4226 | . 2 | |
4 | 1, 2, 3 | mpbir2an 911 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wral 2393 c0 3333 class class class wbr 3899 wfr 4220 wwe 4222 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-v 2662 df-dif 3043 df-in 3047 df-ss 3054 df-nul 3334 df-frfor 4223 df-frind 4224 df-wetr 4226 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |