Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nlimon | Structured version Visualization version GIF version |
Description: Two ways to express the class of non-limit ordinal numbers. Part of Definition 7.27 of [TakeutiZaring] p. 42, who use the symbol KI for this class. (Contributed by NM, 1-Nov-2004.) |
Ref | Expression |
---|---|
nlimon | ⊢ {𝑥 ∈ On ∣ (𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦)} = {𝑥 ∈ On ∣ ¬ Lim 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eloni 6198 | . . 3 ⊢ (𝑥 ∈ On → Ord 𝑥) | |
2 | dflim3 7559 | . . . . 5 ⊢ (Lim 𝑥 ↔ (Ord 𝑥 ∧ ¬ (𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦))) | |
3 | 2 | baib 538 | . . . 4 ⊢ (Ord 𝑥 → (Lim 𝑥 ↔ ¬ (𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦))) |
4 | 3 | con2bid 357 | . . 3 ⊢ (Ord 𝑥 → ((𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦) ↔ ¬ Lim 𝑥)) |
5 | 1, 4 | syl 17 | . 2 ⊢ (𝑥 ∈ On → ((𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦) ↔ ¬ Lim 𝑥)) |
6 | 5 | rabbiia 3471 | 1 ⊢ {𝑥 ∈ On ∣ (𝑥 = ∅ ∨ ∃𝑦 ∈ On 𝑥 = suc 𝑦)} = {𝑥 ∈ On ∣ ¬ Lim 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 208 ∨ wo 843 = wceq 1536 ∈ wcel 2113 ∃wrex 3138 {crab 3141 ∅c0 4288 Ord word 6187 Oncon0 6188 Lim wlim 6189 suc csuc 6190 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5200 ax-nul 5207 ax-pr 5327 ax-un 7458 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3495 df-sbc 3771 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4465 df-pw 4538 df-sn 4565 df-pr 4567 df-tp 4569 df-op 4571 df-uni 4836 df-br 5064 df-opab 5126 df-tr 5170 df-eprel 5462 df-po 5471 df-so 5472 df-fr 5511 df-we 5513 df-ord 6191 df-on 6192 df-lim 6193 df-suc 6194 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |