| 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 1146 | . . 3 ⊢ ((Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) → ∅ ∈ ∅) | |
| 3 | 1, 2 | mto 199 | . 2 ⊢ ¬ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) |
| 4 | dflim2 6393 | . 2 ⊢ (Lim ∅ ↔ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅)) | |
| 5 | 3, 4 | mtbir 325 | 1 ⊢ ¬ Lim ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 ∅c0 4280 ∪ cuni 4859 Ord word 6334 Lim wlim 6336 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-ext 2728 ax-sep 5240 ax-pr 5384 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-sb 2085 df-clab 2735 df-cleq 2748 df-clel 2831 df-ne 2952 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-tr 5202 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-ord 6338 df-lim 6340 |
| This theorem is referenced by: tz7.44lem1 8364 tz7.44-3 8367 1ellim 8455 2ellim 8456 cflim2 10210 rankcf 10725 dfrdg4 36249 limsucncmpi 36753 onov0suclim 43799 |
| Copyright terms: Public domain | W3C validator |