MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dflim3 Structured version   Visualization version   GIF version

Theorem dflim3 7669
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.)
Assertion
Ref Expression
dflim3 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
Distinct variable group:   𝑥,𝐴

Proof of Theorem dflim3
StepHypRef Expression
1 df-lim 6256 . 2 (Lim 𝐴 ↔ (Ord 𝐴𝐴 ≠ ∅ ∧ 𝐴 = 𝐴))
2 3anass 1093 . 2 ((Ord 𝐴𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ (Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = 𝐴)))
3 df-ne 2943 . . . . . 6 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
43a1i 11 . . . . 5 (Ord 𝐴 → (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅))
5 orduninsuc 7665 . . . . 5 (Ord 𝐴 → (𝐴 = 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
64, 5anbi12d 630 . . . 4 (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
7 ioran 980 . . . 4 (¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
86, 7bitr4di 288 . . 3 (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
98pm5.32i 574 . 2 ((Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = 𝐴)) ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
101, 2, 93bitri 296 1 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 395  wo 843  w3a 1085   = wceq 1539  wne 2942  wrex 3064  c0 4253   cuni 4836  Ord word 6250  Oncon0 6251  Lim wlim 6252  suc csuc 6253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257
This theorem is referenced by:  nlimon  7673  tfinds  7681  oalimcl  8353  omlimcl  8371  r1wunlim  10424  dfsucon  41028
  Copyright terms: Public domain W3C validator