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

Theorem trsuc 6404
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 5211 . 2 (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵𝐴))
2 sssucid 6397 . . . . 5 𝐵 ⊆ suc 𝐵
3 ssexg 5266 . . . . 5 ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵 ∈ V)
42, 3mpan 690 . . . 4 (suc 𝐵𝐴𝐵 ∈ V)
5 sucidg 6398 . . . 4 (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
64, 5syl 17 . . 3 (suc 𝐵𝐴𝐵 ∈ suc 𝐵)
76ancri 549 . 2 (suc 𝐵𝐴 → (𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴))
81, 7impel 505 1 ((Tr 𝐴 ∧ suc 𝐵𝐴) → 𝐵𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2113  Vcvv 3438  wss 3899  Tr wtr 5203  suc csuc 6317
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-rab 3398  df-v 3440  df-un 3904  df-in 3906  df-ss 3916  df-sn 4579  df-uni 4862  df-tr 5204  df-suc 6321
This theorem is referenced by:  onuninsuci  7780  limsuc  7789  tz7.44-2  8336  cantnflt  9579  cantnfp1lem3  9587  cantnflem1b  9593  cantnflem1  9596  cnfcom  9607  axdc3lem2  10359  inar1  10684  bnj967  35050  limsuc2  43225
  Copyright terms: Public domain W3C validator