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

Theorem trsuc 6446
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 5243 . 2 (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵𝐴))
2 sssucid 6439 . . . . 5 𝐵 ⊆ suc 𝐵
3 ssexg 5298 . . . . 5 ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵𝐴) → 𝐵 ∈ V)
42, 3mpan 690 . . . 4 (suc 𝐵𝐴𝐵 ∈ V)
5 sucidg 6440 . . . 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 2109  Vcvv 3464  wss 3931  Tr wtr 5234  suc csuc 6359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-sep 5271
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-rab 3421  df-v 3466  df-un 3936  df-in 3938  df-ss 3948  df-sn 4607  df-uni 4889  df-tr 5235  df-suc 6363
This theorem is referenced by:  onuninsuci  7840  limsuc  7849  tz7.44-2  8426  cantnflt  9691  cantnfp1lem3  9699  cantnflem1b  9705  cantnflem1  9708  cnfcom  9719  axdc3lem2  10470  inar1  10794  bnj967  34981  limsuc2  43032
  Copyright terms: Public domain W3C validator