Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ondif1 | Structured version Visualization version GIF version |
Description: Two ways to say that 𝐴 is a nonzero ordinal number. (Contributed by Mario Carneiro, 21-May-2015.) |
Ref | Expression |
---|---|
ondif1 | ⊢ (𝐴 ∈ (On ∖ 1𝑜) ↔ (𝐴 ∈ On ∧ ∅ ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dif1o 7467 | . 2 ⊢ (𝐴 ∈ (On ∖ 1𝑜) ↔ (𝐴 ∈ On ∧ 𝐴 ≠ ∅)) | |
2 | on0eln0 5697 | . . 3 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
3 | 2 | pm5.32i 667 | . 2 ⊢ ((𝐴 ∈ On ∧ ∅ ∈ 𝐴) ↔ (𝐴 ∈ On ∧ 𝐴 ≠ ∅)) |
4 | 1, 3 | bitr4i 266 | 1 ⊢ (𝐴 ∈ (On ∖ 1𝑜) ↔ (𝐴 ∈ On ∧ ∅ ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ wa 383 ∈ wcel 1977 ≠ wne 2780 ∖ cdif 3537 ∅c0 3874 Oncon0 5640 1𝑜c1o 7440 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-tr 4681 df-eprel 4949 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-ord 5643 df-on 5644 df-suc 5646 df-1o 7447 |
This theorem is referenced by: cantnflem2 8470 oef1o 8478 cnfcom3 8484 infxpenc 8724 |
Copyright terms: Public domain | W3C validator |