Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  faosnf0.11b Structured version   Visualization version   GIF version

Theorem faosnf0.11b 43389
Description: 𝐵 is called a non-limit ordinal if it is not a limit ordinal. (Contributed by RP, 27-Sep-2023.)

Alling, Norman L. "Fundamentals of Analysis Over Surreal Numbers Fields." The Rocky Mountain Journal of Mathematics 19, no. 3 (1989): 565-73. http://www.jstor.org/stable/44237243.

Assertion
Ref Expression
faosnf0.11b ((Ord 𝐴 ∧ ¬ Lim 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)
Distinct variable group:   𝑥,𝐴

Proof of Theorem faosnf0.11b
StepHypRef Expression
1 3ancomb 1099 . . 3 ((Ord 𝐴 ∧ ¬ Lim 𝐴𝐴 ≠ ∅) ↔ (Ord 𝐴𝐴 ≠ ∅ ∧ ¬ Lim 𝐴))
2 df-3an 1089 . . 3 ((Ord 𝐴𝐴 ≠ ∅ ∧ ¬ Lim 𝐴) ↔ ((Ord 𝐴𝐴 ≠ ∅) ∧ ¬ Lim 𝐴))
3 df-ne 2947 . . . . . . . 8 (𝐴 ≠ ∅ ↔ ¬ 𝐴 = ∅)
43anbi2i 622 . . . . . . 7 ((Ord 𝐴𝐴 ≠ ∅) ↔ (Ord 𝐴 ∧ ¬ 𝐴 = ∅))
54imbi1i 349 . . . . . 6 (((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ ((Ord 𝐴 ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
6 pm5.6 1002 . . . . . 6 (((Ord 𝐴 ∧ ¬ 𝐴 = ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥) ↔ (Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
7 iman 401 . . . . . 6 ((Ord 𝐴 → (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) ↔ ¬ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
85, 6, 73bitrri 298 . . . . 5 (¬ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)) ↔ ((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
9 dflim3 7884 . . . . 5 (Lim 𝐴 ↔ (Ord 𝐴 ∧ ¬ (𝐴 = ∅ ∨ ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
108, 9xchnxbir 333 . . . 4 (¬ Lim 𝐴 ↔ ((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥))
1110anbi2i 622 . . 3 (((Ord 𝐴𝐴 ≠ ∅) ∧ ¬ Lim 𝐴) ↔ ((Ord 𝐴𝐴 ≠ ∅) ∧ ((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
121, 2, 113bitri 297 . 2 ((Ord 𝐴 ∧ ¬ Lim 𝐴𝐴 ≠ ∅) ↔ ((Ord 𝐴𝐴 ≠ ∅) ∧ ((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)))
13 pm3.35 802 . 2 (((Ord 𝐴𝐴 ≠ ∅) ∧ ((Ord 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)
1412, 13sylbi 217 1 ((Ord 𝐴 ∧ ¬ Lim 𝐴𝐴 ≠ ∅) → ∃𝑥 ∈ On 𝐴 = suc 𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 846  w3a 1087   = wceq 1537  wne 2946  wrex 3076  c0 4352  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: (None)
  Copyright terms: Public domain W3C validator