Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dflim3 | Structured version Visualization version GIF version |
Description: An alternate definition of a limit ordinal, which is any ordinal that is neither zero nor a successor. (Contributed by NM, 1-Nov-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
dflim3 | ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-lim 6271 | . 2 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) | |
2 | 3anass 1094 | . 2 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴))) | |
3 | df-ne 2944 | . . . . . 6 ⊢ (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅) | |
4 | 3 | a1i 11 | . . . . 5 ⊢ (Ord 𝐴 → (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)) |
5 | orduninsuc 7690 | . . . . 5 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
6 | 4, 5 | anbi12d 631 | . . . 4 ⊢ (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))) |
7 | ioran 981 | . . . 4 ⊢ (¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) | |
8 | 6, 7 | bitr4di 289 | . . 3 ⊢ (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) ↔ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥))) |
9 | 8 | pm5.32i 575 | . 2 ⊢ ((Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥))) |
10 | 1, 2, 9 | 3bitri 297 | 1 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∧ wa 396 ∨ wo 844 ∧ w3a 1086 = wceq 1539 ≠ wne 2943 ∃wrex 3065 ∅c0 4256 ∪ cuni 4839 Ord word 6265 Oncon0 6266 Lim wlim 6267 suc csuc 6268 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-tr 5192 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 |
This theorem is referenced by: nlimon 7698 tfinds 7706 oalimcl 8391 omlimcl 8409 r1wunlim 10493 dfsucon 41130 |
Copyright terms: Public domain | W3C validator |