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

Theorem trsuc 6450
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 5226 . 2 (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵𝐴))
2 sssucid 6443 . . . . 5 𝐵 ⊆ suc 𝐵
3 ssexg 5290 . . . . 5 ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵 ∈ V)
42, 3mpan 702 . . . 4 (suc 𝐵𝐴𝐵 ∈ V)
5 sucidg 6444 . . . 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 2143  Vcvv 3455  wss 3905  Tr wtr 5218  suc csuc 6362
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-un 3910  df-in 3912  df-ss 3922  df-sn 4590  df-uni 4873  df-tr 5219  df-suc 6366
This theorem is referenced by:  onuninsuci  7832  limsuc  7841  tz7.44-2  8390  cantnflt  9637  cantnfp1lem3  9645  cantnflem1b  9651  cantnflem1  9654  cnfcom  9665  axdc3lem2  10430  inar1  10755  bnj967  35333  limsuc2  43768
  Copyright terms: Public domain W3C validator