| 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 6371 | . 2 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 2 | ord0eln0 6418 | . 2 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2145 ≠ wne 2957 ∅c0 4282 Ord word 6360 Oncon0 6361 |
| 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 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-tr 5217 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-ord 6364 df-on 6365 |
| This theorem is used by: ondif1 8491 oe0lem 8503 oevn0 8505 oa00 8549 omord 8558 om00 8565 om00el 8566 omeulem1 8572 omeulem2 8573 oewordri 8583 oeordsuc 8585 oelim2 8586 oeoa 8588 oeoe 8590 oeeui 8593 omabs 8642 omxpenlem 9079 cantnff 9656 cantnfp1 9663 cantnflem1d 9670 cantnflem1 9671 cantnflem3 9673 cantnflem4 9674 cantnf 9675 cnfcomlem 9681 cnfcom3 9686 r1tskina 10794 onsucconni 37058 onint1 37070 frlmpwfi 43941 omge1 44140 omge2 44141 omlim2 44142 omord2lim 44143 omord2i 44144 dflim5 44172 tfsconcatb0 44187 tfsconcat0b 44189 oaun3lem1 44217 naddwordnexlem4 44244 omltoe 44249 |
| Copyright terms: Public domain | W3C validator |