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

Step	Hyp	Ref	Expression
1		trel 5224	. 2 ⊢ (Tr 𝐴 → ((𝐵 ∈ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴))
2		sssucid 6444	. . . . 5 ⊢ 𝐵 ⊆ suc 𝐵
3		ssexg 5288	. . . . 5 ⊢ ((𝐵 ⊆ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ V)
4	2, 3	mpan 703	. . . 4 ⊢ (suc 𝐵 ∈ 𝐴 → 𝐵 ∈ V)
5		sucidg 6445	. . . 4 ⊢ (𝐵 ∈ V → 𝐵 ∈ suc 𝐵)
6	4, 5	syl 18	. . 3 ⊢ (suc 𝐵 ∈ 𝐴 → 𝐵 ∈ suc 𝐵)
7	6	ancri 559	. 2 ⊢ (suc 𝐵 ∈ 𝐴 → (𝐵 ∈ suc 𝐵 ∧ suc 𝐵 ∈ 𝐴))
8	1, 7	impel 515	1 ⊢ ((Tr 𝐴 ∧ suc 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902  Tr wtr 5216  suc csuc 6363

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 2734  ax-sep 5255

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 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-un 3907  df-in 3909  df-ss 3919  df-sn 4588  df-uni 4871  df-tr 5217  df-suc 6367

This theorem is used by:  onuninsuci  7840  limsuc  7849  tz7.44-2  8400  cantnflt  9655  cantnfp1lem3  9663  cantnflem1b  9669  cantnflem1  9672  cnfcom  9683  axdc3lem2  10457  inar1  10788  bnj967  35462  limsuc2  43890