Theorem suctr 6451

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 6432	. . . . . 6 ⊢ (𝑦 ∈ suc 𝐴 → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
2		trel 5275	. . . . . . . 8 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
3	2	expdimp 451	. . . . . . 7 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴))
4		eleq2 2820	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝐴))
5	4	biimpcd 248	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑦 → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
6	5	adantl 480	. . . . . . 7 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
7	3, 6	jaod 855	. . . . . 6 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → ((𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴) → 𝑧 ∈ 𝐴))
8	1, 7	syl5 34	. . . . 5 ⊢ ((Tr 𝐴 ∧ 𝑧 ∈ 𝑦) → (𝑦 ∈ suc 𝐴 → 𝑧 ∈ 𝐴))
9	8	expimpd 452	. . . 4 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ 𝐴))
10		elelsuc 6438	. . . 4 ⊢ (𝑧 ∈ 𝐴 → 𝑧 ∈ suc 𝐴)
11	9, 10	syl6 35	. . 3 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
12	11	alrimivv 1929	. 2 ⊢ (Tr 𝐴 → ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
13		dftr2 5268	. 2 ⊢ (Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
14	12, 13	sylibr 233	1 ⊢ (Tr 𝐴 → Tr suc 𝐴)

Syntax hints:   → wi 4   ∧ wa 394   ∨ wo 843  ∀wal 1537   = wceq 1539   ∈ wcel 2104  Tr wtr 5266  suc csuc 6367

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-v 3474  df-un 3954  df-in 3956  df-ss 3966  df-sn 4630  df-uni 4910  df-tr 5267  df-suc 6371

This theorem is referenced by:  ordsuci  7800  dfon2lem3  35059  dfon2lem7  35063  dford3lem2  42070