Theorem suctr 6361

Description: The successor of a transitive class is transitive. (Contributed by Alan Sare, 11-Apr-2009.) (Proof shortened by JJ, 24-Sep-2021.)

Assertion

Ref	Expression
suctr	⊢ (Tr 𝐴 → Tr suc 𝐴)

Proof of Theorem suctr

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elsuci 6342	. . . . . 6 ⊢ (𝑦 ∈ suc 𝐴 → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
2		trel 5205	. . . . . . . 8 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
3	2	expdimp 452	. . . . . . 7 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴))
4		eleq2 2823	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝐴))
5	4	biimpcd 248	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑦 → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
6	5	adantl 481	. . . . . . 7 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
7	3, 6	jaod 855	. . . . . 6 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → ((𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴) → 𝑧 ∈ 𝐴))
8	1, 7	syl5 34	. . . . 5 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 ∈ suc 𝐴 → 𝑧 ∈ 𝐴))
9	8	expimpd 453	. . . 4 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ 𝐴))
10		elelsuc 6348	. . . 4 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ suc 𝐴)
11	9, 10	syl6 35	. . 3 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
12	11	alrimivv 1927	. 2 ⊢ (Tr 𝐴 → ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
13		dftr2 5198	. 2 ⊢ (Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
14	12, 13	sylibr 233	1 ⊢ (Tr 𝐴 → Tr suc 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 843  ∀wal 1535   = wceq 1537   ∈ wcel 2102  Tr wtr 5196  suc csuc 6278

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2104  ax-9 2112  ax-ext 2705

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1540  df-ex 1778  df-sb 2064  df-clab 2712  df-cleq 2726  df-clel 2812  df-v 3437  df-un 3895  df-in 3897  df-ss 3907  df-sn 4566  df-uni 4843  df-tr 5197  df-suc 6282

This theorem is referenced by:  dfon2lem3  33796  dfon2lem7  33800  dford3lem2  40880