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

Theorem ord3ex 5288
Description: The ordinal number 3 is a set, proved without the Axiom of Union ax-un 7461. (Contributed by NM, 2-May-2009.)
Assertion
Ref Expression
ord3ex {∅, {∅}, {∅, {∅}}} ∈ V

Proof of Theorem ord3ex
StepHypRef Expression
1 df-tp 4572 . 2 {∅, {∅}, {∅, {∅}}} = ({∅, {∅}} ∪ {{∅, {∅}}})
2 pwpr 4832 . . . 4 𝒫 {∅, {∅}} = ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}})
3 pp0ex 5287 . . . . 5 {∅, {∅}} ∈ V
43pwex 5281 . . . 4 𝒫 {∅, {∅}} ∈ V
52, 4eqeltrri 2910 . . 3 ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) ∈ V
6 snsspr2 4748 . . . 4 {{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}}
7 unss2 4157 . . . 4 ({{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}} → ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}))
86, 7ax-mp 5 . . 3 ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}})
95, 8ssexi 5226 . 2 ({∅, {∅}} ∪ {{∅, {∅}}}) ∈ V
101, 9eqeltri 2909 1 {∅, {∅}, {∅, {∅}}} ∈ V
Colors of variables: wff setvar class
Syntax hints:  wcel 2114  Vcvv 3494  cun 3934  wss 3936  c0 4291  𝒫 cpw 4539  {csn 4567  {cpr 4569  {ctp 4571
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 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator