MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0we1 Structured version   Visualization version   GIF version

Theorem 0we1 8552
Description: The empty set is a well-ordering of ordinal one. (Contributed by Mario Carneiro, 9-Feb-2015.)
Assertion
Ref Expression
0we1 ∅ We 1o

Proof of Theorem 0we1
StepHypRef Expression
1 br0 5160 . . 3 ¬ ∅∅∅
2 rel0 5785 . . . 4 Rel ∅
3 wesn 5748 . . . 4 (Rel ∅ → (∅ We {∅} ↔ ¬ ∅∅∅))
42, 3ax-mp 5 . . 3 (∅ We {∅} ↔ ¬ ∅∅∅)
51, 4mpbir 234 . 2 ∅ We {∅}
6 df1o2 8521 . . 3 1o = {∅}
7 weeq2 5646 . . 3 (1o = {∅} → (∅ We 1o ↔ ∅ We {∅}))
86, 7ax-mp 5 . 2 (∅ We 1o ↔ ∅ We {∅})
95, 8mpbir 234 1 ∅ We 1o
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1570  ∅c0 4281  {csn 4588   class class class wbr 5108   We wwe 5610  Rel wrel 5663  1oc1o 8507
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-suc 6394  df-1o 8514
This theorem is used by:  psr1tos  22562
  Copyright terms: Public domain W3C validator