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

Theorem dflim3 7884
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 6400 . 2 (Lim 𝐴 ↔ (Ord 𝐴𝐴 ≠ ∅ ∧ 𝐴 = 𝐴))
2 3anass 1095 . 2 ((Ord 𝐴𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ (Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = 𝐴)))
3 df-ne 2947 . . . . . 6 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
43a1i 11 . . . . 5 (Ord 𝐴 → (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅))
5 orduninsuc 7880 . . . . 5 (Ord 𝐴 → (𝐴 = 𝐴 ↔ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
64, 5anbi12d 631 . . . 4 (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
7 ioran 984 . . . 4 (¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (¬ 𝐴 = ∅ ∧ ¬ ∃𝑥 ∈ On 𝐴 = suc 𝑥))
86, 7bitr4di 289 . . 3 (Ord 𝐴 → ((𝐴 ≠ ∅ ∧ 𝐴 = 𝐴) ↔ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
98pm5.32i 574 . 2 ((Ord 𝐴 ∧ (𝐴 ≠ ∅ ∧ 𝐴 = 𝐴)) ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
101, 2, 93bitri 297 1 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206  wa 395  wo 846  w3a 1087   = wceq 1537  wne 2946  wrex 3076  c0 4352   cuni 4931  Ord word 6394  Oncon0 6395  Lim wlim 6396  suc csuc 6397
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401
This theorem is referenced by:  nlimon  7888  tfinds  7897  oalimcl  8616  omlimcl  8634  r1wunlim  10806  dflim6  43226  naddgeoa  43356  faosnf0.11b  43389  dfsucon  43485
  Copyright terms: Public domain W3C validator