ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nlimsucg GIF version

Theorem nlimsucg 4395
Description: A successor is not a limit ordinal. (Contributed by NM, 25-Mar-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
nlimsucg (𝐴𝑉 → ¬ Lim suc 𝐴)

Proof of Theorem nlimsucg
StepHypRef Expression
1 limord 4231 . . . . . 6 (Lim suc 𝐴 → Ord suc 𝐴)
2 ordsuc 4392 . . . . . 6 (Ord 𝐴 ↔ Ord suc 𝐴)
31, 2sylibr 133 . . . . 5 (Lim suc 𝐴 → Ord 𝐴)
4 limuni 4232 . . . . 5 (Lim suc 𝐴 → suc 𝐴 = suc 𝐴)
53, 4jca 301 . . . 4 (Lim suc 𝐴 → (Ord 𝐴 ∧ suc 𝐴 = suc 𝐴))
6 ordtr 4214 . . . . . . . 8 (Ord 𝐴 → Tr 𝐴)
7 unisucg 4250 . . . . . . . . 9 (𝐴𝑉 → (Tr 𝐴 suc 𝐴 = 𝐴))
87biimpa 291 . . . . . . . 8 ((𝐴𝑉 ∧ Tr 𝐴) → suc 𝐴 = 𝐴)
96, 8sylan2 281 . . . . . . 7 ((𝐴𝑉 ∧ Ord 𝐴) → suc 𝐴 = 𝐴)
109eqeq2d 2100 . . . . . 6 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = suc 𝐴 ↔ suc 𝐴 = 𝐴))
11 ordirr 4371 . . . . . . . . 9 (Ord 𝐴 → ¬ 𝐴𝐴)
12 eleq2 2152 . . . . . . . . . 10 (suc 𝐴 = 𝐴 → (𝐴 ∈ suc 𝐴𝐴𝐴))
1312notbid 628 . . . . . . . . 9 (suc 𝐴 = 𝐴 → (¬ 𝐴 ∈ suc 𝐴 ↔ ¬ 𝐴𝐴))
1411, 13syl5ibrcom 156 . . . . . . . 8 (Ord 𝐴 → (suc 𝐴 = 𝐴 → ¬ 𝐴 ∈ suc 𝐴))
15 sucidg 4252 . . . . . . . . 9 (𝐴𝑉𝐴 ∈ suc 𝐴)
1615con3i 598 . . . . . . . 8 𝐴 ∈ suc 𝐴 → ¬ 𝐴𝑉)
1714, 16syl6 33 . . . . . . 7 (Ord 𝐴 → (suc 𝐴 = 𝐴 → ¬ 𝐴𝑉))
1817adantl 272 . . . . . 6 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = 𝐴 → ¬ 𝐴𝑉))
1910, 18sylbid 149 . . . . 5 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = suc 𝐴 → ¬ 𝐴𝑉))
2019expimpd 356 . . . 4 (𝐴𝑉 → ((Ord 𝐴 ∧ suc 𝐴 = suc 𝐴) → ¬ 𝐴𝑉))
215, 20syl5 32 . . 3 (𝐴𝑉 → (Lim suc 𝐴 → ¬ 𝐴𝑉))
2221con2d 590 . 2 (𝐴𝑉 → (𝐴𝑉 → ¬ Lim suc 𝐴))
2322pm2.43i 49 1 (𝐴𝑉 → ¬ Lim suc 𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103   = wceq 1290  wcel 1439   cuni 3659  Tr wtr 3942  Ord word 4198  Lim wlim 4200  suc csuc 4201
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-setind 4366
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-v 2622  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-sn 3456  df-pr 3457  df-uni 3660  df-tr 3943  df-iord 4202  df-ilim 4205  df-suc 4207
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator