Theorem suctrALT2VD 45072

Description: Virtual deduction proof of suctrALT2 45073. (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 5207	. . 3 ⊢ (Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2		sssucid 6399	. . . . . . . 8 ⊢ 𝐴 ⊆ suc 𝐴
3		idn1 44811	. . . . . . . . 9 ⊢ (   Tr 𝐴   ▶   Tr 𝐴   )
4		idn2 44850	. . . . . . . . . 10 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   )
5		simpl 482	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ 𝑦)
6	4, 5	e2 44868	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑧 ∈ 𝑦   )
7		idn3 44852	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑦 ∈ 𝐴   )
8		trel 5213	. . . . . . . . . 10 ⊢ (Tr 𝐴 → ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → 𝑧 ∈ 𝐴))
9	8	expd 415	. . . . . . . . 9 ⊢ (Tr 𝐴 → (𝑧 ∈ 𝑦 → (𝑦 ∈ 𝐴 → 𝑧 ∈ 𝐴)))
10	3, 6, 7, 9	e123 44998	. . . . . . . 8 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑧 ∈ 𝐴   )
11		ssel 3927	. . . . . . . 8 ⊢ (𝐴 ⊆ suc 𝐴 → (𝑧 ∈ 𝐴 → 𝑧 ∈ suc 𝐴))
12	2, 10, 11	e03 44976	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 ∈ 𝐴   ▶   𝑧 ∈ suc 𝐴   )
13	12	in3 44846	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 ∈ 𝐴 → 𝑧 ∈ suc 𝐴)   )
14		idn3 44852	. . . . . . . . 9 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑦 = 𝐴   )
15		eleq2 2825	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → (𝑧 ∈ 𝑦 ↔ 𝑧 ∈ 𝐴))
16	15	biimpcd 249	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑦 → (𝑦 = 𝐴 → 𝑧 ∈ 𝐴))
17	6, 14, 16	e23 44991	. . . . . . . 8 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧 ∈ 𝐴   )
18	2, 17, 11	e03 44976	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧 ∈ suc 𝐴   )
19	18	in3 44846	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 = 𝐴 → 𝑧 ∈ suc 𝐴)   )
20		simpr 484	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
21	4, 20	e2 44868	. . . . . . 7 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑦 ∈ suc 𝐴   )
22		elsuci 6386	. . . . . . 7 ⊢ (𝑦 ∈ suc 𝐴 → (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴))
23	21, 22	e2 44868	. . . . . 6 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴)   )
24		jao 962	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 → 𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴 → 𝑧 ∈ suc 𝐴) → ((𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
25	13, 19, 23, 24	e222 44873	. . . . 5 ⊢ (   Tr 𝐴   ,   (𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴)   ▶   𝑧 ∈ suc 𝐴   )
26	25	in2 44842	. . . 4 ⊢ (   Tr 𝐴   ▶   ((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
27	26	gen12 44855	. . 3 ⊢ (   Tr 𝐴   ▶   ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
28		biimpr 220	. . 3 ⊢ ((Tr suc 𝐴 ↔ ∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)) → (∀𝑧∀𝑦((𝑧 ∈ 𝑦 ∧ 𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴) → Tr suc 𝐴))
29	1, 27, 28	e01 44928	. 2 ⊢ (   Tr 𝐴   ▶   Tr suc 𝐴   )
30	29	in1 44808	1 ⊢ (Tr 𝐴 → Tr suc 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847  ∀wal 1539   = wceq 1541   ∈ wcel 2113   ⊆ wss 3901  Tr wtr 5205  suc csuc 6319

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3442  df-un 3906  df-ss 3918  df-sn 4581  df-uni 4864  df-tr 5206  df-suc 6323  df-vd1 44807  df-vd2 44815  df-vd3 44827

This theorem is referenced by: (None)