Theorem suctrALT3 46097

Description: The successor of a transitive class is transitive. suctrALT3 46097 is the completed proof in conventional notation of the Virtual Deduction proof https://us.metamath.org/other/completeusersproof/suctralt3vd.html 46097. It was completed manually. The potential for automated derivation from the VD proof exists. See wvd1 45743 for a description of Virtual Deduction. Some sub-theorems of the proof were completed using a unification deduction (e.g., the sub-theorem whose assertion is step 19 used jaoded 45740). Unification deductions employ Mario Carneiro's metavariable concept. Some sub-theorems were completed using a unification theorem (e.g., the sub-theorem whose assertion is step 24 used dftr2 5217) . (Contributed by Alan Sare, 3-Dec-2015.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Proof of Theorem suctrALT3

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

Step	Hyp	Ref	Expression
1		sssucid 6463	. . . . . . . . 9 ⊢ 𝐴 ⊆ suc 𝐴
2		id 23	. . . . . . . . . 10 ⊢ (Tr 𝐴 → Tr 𝐴)
3		id 23	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴))
4	3	simpld 500	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ 𝑦)
5		id 23	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐴)
6	2, 4, 5	trelded 45739	. . . . . . . . 9 ⊢ ((Tr 𝐴 ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴)
7	1, 6	sselid 3911	. . . . . . . 8 ⊢ ((Tr 𝐴 ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ suc 𝐴)
8	7	3expia 1139	. . . . . . 7 ⊢ ((Tr 𝐴 ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)) → (𝑦 ∈ 𝐴 → 𝑧 ∈ suc 𝐴))
9		id 23	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → 𝑦 = 𝐴)
10		eleq2 2853	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝐴))
11	10	biimpac 484	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 = 𝐴) → 𝑧 ∈ 𝐴)
12	4, 9, 11	syl2an 608	. . . . . . . . 9 ⊢ (((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) ∧ 𝑦 = 𝐴) → 𝑧 ∈ 𝐴)
13	1, 12	sselid 3911	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) ∧ 𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)
14	13	ex 418	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴 → 𝑧 ∈ suc 𝐴))
15	3	simprd 501	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
16		elsuci 6450	. . . . . . . 8 ⊢ (𝑦 ∈ suc 𝐴 → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
17	15, 16	syl 18	. . . . . . 7 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
18	8, 14, 17	jaoded 45740	. . . . . 6 ⊢ (((Tr 𝐴 ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)) ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)) → 𝑧 ∈ suc 𝐴)
19	18	un2122 45963	. . . . 5 ⊢ ((Tr 𝐴 ∧ (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)) → 𝑧 ∈ suc 𝐴)
20	19	ex 418	. . . 4 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
21	20	alrimivv 1963	. . 3 ⊢ (Tr 𝐴 → ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
22		dftr2 5217	. . . 4 ⊢ (Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
23	22	biimpri 231	. . 3 ⊢ (∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴) → Tr suc 𝐴)
24	21, 23	syl 18	. 2 ⊢ (Tr 𝐴 → Tr suc 𝐴)
25	24	idiALT 45652	1 ⊢ (Tr 𝐴 → Tr suc 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Tr wtr 5215  suc csuc 6382

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-uni 4871  df-tr 5216  df-suc 6386

This theorem is used by: (None)