| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nlim0 | Structured version Visualization version GIF version | ||
| Description: The empty set is not a limit ordinal. (Contributed by NM, 24-Mar-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| nlim0 | ⊢ ¬ Lim ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 4291 | . . 3 ⊢ ¬ ∅ ∈ ∅ | |
| 2 | simp2 1155 | . . 3 ⊢ ((Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) → ∅ ∈ ∅) | |
| 3 | 1, 2 | mto 200 | . 2 ⊢ ¬ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) |
| 4 | dflim2 6423 | . 2 ⊢ (Lim ∅ ↔ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅)) | |
| 5 | 3, 4 | mtbir 326 | 1 ⊢ ¬ Lim ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∅c0 4286 ∪ cuni 4874 Ord word 6363 Lim wlim 6365 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6367 df-lim 6369 |
| This theorem is used by: tz7.44lem1 8398 tz7.44-3 8401 1ellim 8489 2ellim 8490 cflim2 10262 rankcf 10779 dfrdg4 36482 limsucncmpi 37015 onov0suclim 44061 |
| Copyright terms: Public domain | W3C validator |