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

Theorem trsuc 6451
Description: A set whose successor belongs to a transitive class also belongs. (Contributed by NM, 5-Sep-2003.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)
Assertion
Ref Expression
trsuc ((Tr 𝐴 ∧ suc 𝐵𝐴) → 𝐵𝐴)

Proof of Theorem trsuc
StepHypRef Expression
1 trel 5230 . 2 (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵𝐴))
2 sssucid 6444 . . . . 5 𝐵 ⊆ suc 𝐵
3 ssexg 5294 . . . . 5 ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵 ∈ V)
42, 3mpan 702 . . . 4 (suc 𝐵𝐴𝐵 ∈ V)
5 sucidg 6445 . . . 4 (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
64, 5syl 18 . . 3 (suc 𝐵𝐴𝐵 ∈ suc 𝐵)
76ancri 558 . 2 (suc 𝐵𝐴 → (𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴))
81, 7impel 514 1 ((Tr 𝐴 ∧ suc 𝐵𝐴) → 𝐵𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wcel 2149  Vcvv 3463  wss 3913  Tr wtr 5222  suc csuc 6363
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-un 3918  df-in 3920  df-ss 3930  df-sn 4595  df-uni 4877  df-tr 5223  df-suc 6367
This theorem is referenced by:  onuninsuci  7835  limsuc  7844  tz7.44-2  8393  cantnflt  9640  cantnfp1lem3  9648  cantnflem1b  9654  cantnflem1  9657  cnfcom  9668  axdc3lem2  10434  inar1  10759  bnj967  35277  limsuc2  43659
  Copyright terms: Public domain W3C validator