| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > on0eln0 | Structured version Visualization version GIF version | ||
| Description: An ordinal number contains zero iff it is nonzero. (Contributed by NM, 6-Dec-2004.) |
| Ref | Expression |
|---|---|
| on0eln0 | ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eloni 6372 | . 2 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 2 | ord0eln0 6419 | . 2 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2143 ≠ wne 2958 ∅c0 4287 Ord word 6361 Oncon0 6362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-tr 5220 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6365 df-on 6366 |
| This theorem is referenced by: ondif1 8487 oe0lem 8499 oevn0 8501 oa00 8545 omord 8554 om00 8561 om00el 8562 omeulem1 8568 omeulem2 8569 oewordri 8579 oeordsuc 8581 oelim2 8582 oeoa 8584 oeoe 8586 oeeui 8589 omabs 8638 omxpenlem 9067 cantnff 9644 cantnfp1 9651 cantnflem1d 9658 cantnflem1 9659 cantnflem3 9661 cantnflem4 9662 cantnf 9663 cnfcomlem 9669 cnfcom3 9674 r1tskina 10768 onsucconni 36929 onint1 36941 frlmpwfi 43808 omge1 44007 omge2 44008 omlim2 44009 omord2lim 44010 omord2i 44011 dflim5 44039 tfsconcatb0 44054 tfsconcat0b 44056 oaun3lem1 44084 naddwordnexlem4 44111 omltoe 44116 |
| Copyright terms: Public domain | W3C validator |