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

Theorem trsuc 6452
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 5220 . 2 (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴))
2 sssucid 6445 . . . . 5 𝐵 ⊆ suc 𝐵
3 ssexg 5281 . . . . 5 ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ V)
42, 3mpan 703 . . . 4 (suc 𝐵 ∈ 𝐴 → 𝐵 ∈ V)
5 sucidg 6446 . . . 4 (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
64, 5syl 18 . . 3 (suc 𝐵 ∈ 𝐴 → 𝐵 ∈ suc 𝐵)
76ancri 559 . 2 (suc 𝐵 ∈ 𝐴 → (𝐵 ∈ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴))
81, 7impel 515 1 ((Tr 𝐴 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  Tr wtr 5212  suc csuc 6364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-un 3904  df-in 3906  df-ss 3916  df-sn 4585  df-uni 4868  df-tr 5213  df-suc 6368
This theorem is used by:  onuninsuci  7851  limsuc  7860  tz7.44-2  8415  cantnflt  9673  cantnfp1lem3  9681  cantnflem1b  9687  cantnflem1  9690  cnfcom  9701  axdc3lem2  10529  inar1  10860  bnj967  35575  limsuc2  44047
  Copyright terms: Public domain W3C validator