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

Theorem nlimsucg 4664
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 4492 . . . . . 6 (Lim suc 𝐴 → Ord suc 𝐴)
2 ordsuc 4661 . . . . . 6 (Ord 𝐴 ↔ Ord suc 𝐴)
31, 2sylibr 134 . . . . 5 (Lim suc 𝐴 → Ord 𝐴)
4 limuni 4493 . . . . 5 (Lim suc 𝐴 → suc 𝐴 = suc 𝐴)
53, 4jca 306 . . . 4 (Lim suc 𝐴 → (Ord 𝐴 ∧ suc 𝐴 = suc 𝐴))
6 ordtr 4475 . . . . . . . 8 (Ord 𝐴 → Tr 𝐴)
7 unisucg 4511 . . . . . . . . 9 (𝐴𝑉 → (Tr 𝐴 suc 𝐴 = 𝐴))
87biimpa 296 . . . . . . . 8 ((𝐴𝑉 ∧ Tr 𝐴) → suc 𝐴 = 𝐴)
96, 8sylan2 286 . . . . . . 7 ((𝐴𝑉 ∧ Ord 𝐴) → suc 𝐴 = 𝐴)
109eqeq2d 2243 . . . . . 6 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = suc 𝐴 ↔ suc 𝐴 = 𝐴))
11 ordirr 4640 . . . . . . . . 9 (Ord 𝐴 → ¬ 𝐴𝐴)
12 eleq2 2295 . . . . . . . . . 10 (suc 𝐴 = 𝐴 → (𝐴 ∈ suc 𝐴𝐴𝐴))
1312notbid 673 . . . . . . . . 9 (suc 𝐴 = 𝐴 → (¬ 𝐴 ∈ suc 𝐴 ↔ ¬ 𝐴𝐴))
1411, 13syl5ibrcom 157 . . . . . . . 8 (Ord 𝐴 → (suc 𝐴 = 𝐴 → ¬ 𝐴 ∈ suc 𝐴))
15 sucidg 4513 . . . . . . . . 9 (𝐴𝑉𝐴 ∈ suc 𝐴)
1615con3i 637 . . . . . . . 8 𝐴 ∈ suc 𝐴 → ¬ 𝐴𝑉)
1714, 16syl6 33 . . . . . . 7 (Ord 𝐴 → (suc 𝐴 = 𝐴 → ¬ 𝐴𝑉))
1817adantl 277 . . . . . 6 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = 𝐴 → ¬ 𝐴𝑉))
1910, 18sylbid 150 . . . . 5 ((𝐴𝑉 ∧ Ord 𝐴) → (suc 𝐴 = suc 𝐴 → ¬ 𝐴𝑉))
2019expimpd 363 . . . 4 (𝐴𝑉 → ((Ord 𝐴 ∧ suc 𝐴 = suc 𝐴) → ¬ 𝐴𝑉))
215, 20syl5 32 . . 3 (𝐴𝑉 → (Lim suc 𝐴 → ¬ 𝐴𝑉))
2221con2d 629 . 2 (𝐴𝑉 → (𝐴𝑉 → ¬ Lim suc 𝐴))
2322pm2.43i 49 1 (𝐴𝑉 → ¬ Lim suc 𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1397  wcel 2202   cuni 3893  Tr wtr 4187  Ord word 4459  Lim wlim 4461  suc csuc 4462
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-sn 3675  df-pr 3676  df-uni 3894  df-tr 4188  df-iord 4463  df-ilim 4466  df-suc 4468
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator