Theorem suctrALT2VD 45585

Description: Virtual deduction proof of suctrALT2 45586. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Proof of Theorem suctrALT2VD

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

Step	Hyp	Ref	Expression
1		dftr2 5225	. . 3 ⊢ (Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2		sssucid 6450	. . . . . . . 8 ⊢ 𝐴 ⊆ suc 𝐴
3		idn1 45324	. . . . . . . . 9 ⊢ (   Tr 𝐴   ▶   Tr 𝐴   )
4		idn2 45363	. . . . . . . . . 10 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   )
5		simpl 488	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ 𝑦)
6	4, 5	e2 45381	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑧 ∈ 𝑦   )
7		idn3 45365	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑦 ∈ 𝐴   )
8		trel 5231	. . . . . . . . . 10 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
9	8	expd 421	. . . . . . . . 9 ⊢ (Tr 𝐴 → (𝑧 ∈ 𝑦 → (𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴)))
10	3, 6, 7, 9	e123 45511	. . . . . . . 8 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑧 ∈ 𝐴   )
11		ssel 3934	. . . . . . . 8 ⊢ (𝐴 ⊆ suc 𝐴 → (𝑧 ∈ 𝐴 → 𝑧 ∈ suc 𝐴))
12	2, 10, 11	e03 45489	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑧 ∈ suc 𝐴   )
13	12	in3 45359	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 ∈ 𝐴 → 𝑧 ∈ suc 𝐴)   )
14		idn3 45365	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑦 = 𝐴   )
15		eleq2 2855	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝐴))
16	15	biimpcd 252	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑦 → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
17	6, 14, 16	e23 45504	. . . . . . . 8 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧 ∈ 𝐴   )
18	2, 17, 11	e03 45489	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧 ∈ suc 𝐴   )
19	18	in3 45359	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 = 𝐴 → 𝑧 ∈ suc 𝐴)   )
20		simpr 490	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
21	4, 20	e2 45381	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑦 ∈ suc 𝐴   )
22		elsuci 6437	. . . . . . 7 ⊢ (𝑦 ∈ suc 𝐴 → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
23	21, 22	e2 45381	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴)   )
24		jao 975	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 → 𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴 → 𝑧 ∈ suc 𝐴) → ((𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
25	13, 19, 23, 24	e222 45386	. . . . 5 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑧 ∈ suc 𝐴   )
26	25	in2 45355	. . . 4 ⊢ (   Tr 𝐴   ▶   ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
27	26	gen12 45368	. . 3 ⊢ (   Tr 𝐴   ▶   ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
28		biimpr 223	. . 3 ⊢ ((Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)) → (∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴) → Tr suc 𝐴))
29	1, 27, 28	e01 45441	. 2 ⊢ (   Tr 𝐴   ▶   Tr suc 𝐴   )
30	29	in1 45321	1 ⊢ (Tr 𝐴 → Tr suc 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570   ∈ wcel 2146   ⊆ wss 3908  Tr wtr 5223  suc csuc 6369

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 2148  ax-9 2156  ax-ext 2738

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 2745  df-cleq 2758  df-clel 2841  df-v 3460  df-un 3913  df-ss 3925  df-sn 4595  df-uni 4878  df-tr 5224  df-suc 6373  df-vd1 45320  df-vd2 45328  df-vd3 45340

This theorem is used by: (None)