| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ord3ex | Structured version Visualization version GIF version | ||
| Description: The ordinal number 3 is a set, proved without the Axiom of Union ax-un 7690. (Contributed by NM, 2-May-2009.) |
| Ref | Expression |
|---|---|
| ord3ex | ⊢ {∅, {∅}, {∅, {∅}}} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-tp 4587 | . 2 ⊢ {∅, {∅}, {∅, {∅}}} = ({∅, {∅}} ∪ {{∅, {∅}}}) | |
| 2 | pwpr 4859 | . . . 4 ⊢ 𝒫 {∅, {∅}} = ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) | |
| 3 | pp0ex 5333 | . . . . 5 ⊢ {∅, {∅}} ∈ V | |
| 4 | 3 | pwex 5327 | . . . 4 ⊢ 𝒫 {∅, {∅}} ∈ V |
| 5 | 2, 4 | eqeltrri 2834 | . . 3 ⊢ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) ∈ V |
| 6 | snsspr2 4773 | . . . 4 ⊢ {{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}} | |
| 7 | unss2 4141 | . . . 4 ⊢ ({{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}} → ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}})) | |
| 8 | 6, 7 | ax-mp 5 | . . 3 ⊢ ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) |
| 9 | 5, 8 | ssexi 5269 | . 2 ⊢ ({∅, {∅}} ∪ {{∅, {∅}}}) ∈ V |
| 10 | 1, 9 | eqeltri 2833 | 1 ⊢ {∅, {∅}, {∅, {∅}}} ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 Vcvv 3442 ∪ cun 3901 ⊆ wss 3903 ∅c0 4287 𝒫 cpw 4556 {csn 4582 {cpr 4584 {ctp 4586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |