| 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 4279 | . . 3 ⊢ ¬ ∅ ∈ ∅ | |
| 2 | simp2 1138 | . . 3 ⊢ ((Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) → ∅ ∈ ∅) | |
| 3 | 1, 2 | mto 197 | . 2 ⊢ ¬ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅) |
| 4 | dflim2 6375 | . 2 ⊢ (Lim ∅ ↔ (Ord ∅ ∧ ∅ ∈ ∅ ∧ ∅ = ∪ ∅)) | |
| 5 | 3, 4 | mtbir 323 | 1 ⊢ ¬ Lim ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∅c0 4274 ∪ cuni 4851 Ord word 6316 Lim wlim 6318 |
| 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 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-ord 6320 df-lim 6322 |
| This theorem is referenced by: tz7.44lem1 8337 tz7.44-3 8340 1ellim 8426 2ellim 8427 cflim2 10176 rankcf 10691 dfrdg4 36149 limsucncmpi 36643 onov0suclim 43720 |
| Copyright terms: Public domain | W3C validator |