Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ord3ex | GIF version |
Description: The ordinal number 3 is a set, proved without the Axiom of Union. (Contributed by NM, 2-May-2009.) |
Ref | Expression |
---|---|
ord3ex | ⊢ {∅, {∅}, {∅, {∅}}} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-tp 3597 | . 2 ⊢ {∅, {∅}, {∅, {∅}}} = ({∅, {∅}} ∪ {{∅, {∅}}}) | |
2 | pp0ex 4184 | . . . . 5 ⊢ {∅, {∅}} ∈ V | |
3 | 2 | pwex 4178 | . . . 4 ⊢ 𝒫 {∅, {∅}} ∈ V |
4 | pwprss 3801 | . . . 4 ⊢ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) ⊆ 𝒫 {∅, {∅}} | |
5 | 3, 4 | ssexi 4136 | . . 3 ⊢ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) ∈ V |
6 | snsspr2 3738 | . . . 4 ⊢ {{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}} | |
7 | unss2 3304 | . . . 4 ⊢ ({{∅, {∅}}} ⊆ {{{∅}}, {∅, {∅}}} → ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}})) | |
8 | 6, 7 | ax-mp 5 | . . 3 ⊢ ({∅, {∅}} ∪ {{∅, {∅}}}) ⊆ ({∅, {∅}} ∪ {{{∅}}, {∅, {∅}}}) |
9 | 5, 8 | ssexi 4136 | . 2 ⊢ ({∅, {∅}} ∪ {{∅, {∅}}}) ∈ V |
10 | 1, 9 | eqeltri 2248 | 1 ⊢ {∅, {∅}, {∅, {∅}}} ∈ V |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 2146 Vcvv 2735 ∪ cun 3125 ⊆ wss 3127 ∅c0 3420 𝒫 cpw 3572 {csn 3589 {cpr 3590 {ctp 3591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-nul 4124 ax-pow 4169 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-v 2737 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-nul 3421 df-pw 3574 df-sn 3595 df-pr 3596 df-tp 3597 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |