Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dflim2 | Structured version Visualization version GIF version |
Description: An alternate definition of a limit ordinal. (Contributed by NM, 4-Nov-2004.) |
Ref | Expression |
---|---|
dflim2 | ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-lim 5645 | . 2 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) | |
2 | ord0eln0 5696 | . . . . 5 ⊢ (Ord 𝐴 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅)) | |
3 | 2 | anbi1d 737 | . . . 4 ⊢ (Ord 𝐴 → ((∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴))) |
4 | 3 | pm5.32i 667 | . . 3 ⊢ ((Ord 𝐴 ∧ (∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) ↔ (Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴))) |
5 | 3anass 1035 | . . 3 ⊢ ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐴 ∧ (∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴))) | |
6 | 3anass 1035 | . . 3 ⊢ ((Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴))) | |
7 | 4, 5, 6 | 3bitr4i 291 | . 2 ⊢ ((Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴) ↔ (Ord 𝐴 ∧ 𝐴 ≠ ∅ ∧ 𝐴 = ∪ 𝐴)) |
8 | 1, 7 | bitr4i 266 | 1 ⊢ (Lim 𝐴 ↔ (Ord 𝐴 ∧ ∅ ∈ 𝐴 ∧ 𝐴 = ∪ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∅c0 3874 ∪ cuni 4372 Ord word 5639 Lim wlim 5641 |
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-lim 5645 |
This theorem is referenced by: nlim0 5700 dflim4 6940 |
Copyright terms: Public domain | W3C validator |