Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onsucuni3 Structured version   Visualization version   GIF version

Theorem onsucuni3 34651
Description: If an ordinal number has a predecessor, then it is successor of that predecessor. (Contributed by ML, 17-Oct-2020.)
Assertion
Ref Expression
onsucuni3 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc 𝐵)

Proof of Theorem onsucuni3
StepHypRef Expression
1 eloni 6201 . . . . 5 (𝐵 ∈ On → Ord 𝐵)
213ad2ant1 1129 . . . 4 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → Ord 𝐵)
3 orduniorsuc 7545 . . . 4 (Ord 𝐵 → (𝐵 = 𝐵𝐵 = suc 𝐵))
42, 3syl 17 . . 3 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = 𝐵𝐵 = suc 𝐵))
54orcomd 867 . 2 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → (𝐵 = suc 𝐵𝐵 = 𝐵))
6 simp2 1133 . . 3 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 ≠ ∅)
7 df-lim 6196 . . . . . . . 8 (Lim 𝐵 ↔ (Ord 𝐵𝐵 ≠ ∅ ∧ 𝐵 = 𝐵))
87biimpri 230 . . . . . . 7 ((Ord 𝐵𝐵 ≠ ∅ ∧ 𝐵 = 𝐵) → Lim 𝐵)
983expb 1116 . . . . . 6 ((Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = 𝐵)) → Lim 𝐵)
109con3i 157 . . . . 5 (¬ Lim 𝐵 → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = 𝐵)))
11103ad2ant3 1131 . . . 4 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (Ord 𝐵 ∧ (𝐵 ≠ ∅ ∧ 𝐵 = 𝐵)))
122, 11mpnanrd 412 . . 3 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ (𝐵 ≠ ∅ ∧ 𝐵 = 𝐵))
136, 12mpnanrd 412 . 2 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → ¬ 𝐵 = 𝐵)
14 orcom 866 . . 3 ((𝐵 = suc 𝐵𝐵 = 𝐵) ↔ (𝐵 = 𝐵𝐵 = suc 𝐵))
15 df-or 844 . . 3 ((𝐵 = 𝐵𝐵 = suc 𝐵) ↔ (¬ 𝐵 = 𝐵𝐵 = suc 𝐵))
1614, 15sylbb 221 . 2 ((𝐵 = suc 𝐵𝐵 = 𝐵) → (¬ 𝐵 = 𝐵𝐵 = suc 𝐵))
175, 13, 16sylc 65 1 ((𝐵 ∈ On ∧ 𝐵 ≠ ∅ ∧ ¬ Lim 𝐵) → 𝐵 = suc 𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  wo 843  w3a 1083   = wceq 1537  wcel 2114  wne 3016  c0 4291   cuni 4838  Ord word 6190  Oncon0 6191  Lim wlim 6192  suc csuc 6193
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-tr 5173  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197
This theorem is referenced by:  1oequni2o  34652  rdgsucuni  34653  finxpreclem4  34678
  Copyright terms: Public domain W3C validator