| 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 4285 | . . 3 ⊢ ¬ ∅ ∈ ∅ | |
| 2 | simp2 1155 | . . 3 ⊢ ((Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) → ∅ ∈ ∅) | |
| 3 | 1, 2 | mto 200 | . 2 ⊢ ¬ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) |
| 4 | dflim2 6427 | . 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 1569 ∈ wcel 2146 ∅c0 4280 ∪ cuni 4869 Ord word 6367 Lim wlim 6369 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-br 5106 df-opab 5170 df-tr 5215 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-ord 6371 df-lim 6373 |
| This theorem is used by: tz7.44lem1 8424 tz7.44-3 8427 1ellim 8517 2ellim 8518 cflim2 10351 rankcf 10872 dfrdg4 36842 limsucncmpi 37360 onov0suclim 44416 |
| Copyright terms: Public domain | W3C validator |