Mathbox for Alan Sare < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  suctrALT2VD Structured version   Visualization version   GIF version

Theorem suctrALT2VD 38093
 Description: Virtual deduction proof of suctrALT2 38094. (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.
StepHypRef Expression
1 dftr2 4682 . . 3 (Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2 sssucid 5719 . . . . . . . 8 𝐴 ⊆ suc 𝐴
3 idn1 37811 . . . . . . . . 9 (   Tr 𝐴   ▶   Tr 𝐴   )
4 idn2 37859 . . . . . . . . . 10 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   (𝑧𝑦𝑦 ∈ suc 𝐴)   )
5 simpl 472 . . . . . . . . . 10 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦)
64, 5e2 37877 . . . . . . . . 9 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   𝑧𝑦   )
7 idn3 37861 . . . . . . . . 9 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦𝐴   ▶   𝑦𝐴   )
8 trel 4687 . . . . . . . . . 10 (Tr 𝐴 → ((𝑧𝑦𝑦𝐴) → 𝑧𝐴))
98expd 451 . . . . . . . . 9 (Tr 𝐴 → (𝑧𝑦 → (𝑦𝐴𝑧𝐴)))
103, 6, 7, 9e123 38010 . . . . . . . 8 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦𝐴   ▶   𝑧𝐴   )
11 ssel 3562 . . . . . . . 8 (𝐴 ⊆ suc 𝐴 → (𝑧𝐴𝑧 ∈ suc 𝐴))
122, 10, 11e03 37988 . . . . . . 7 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦𝐴   ▶   𝑧 ∈ suc 𝐴   )
1312in3 37855 . . . . . 6 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   (𝑦𝐴𝑧 ∈ suc 𝐴)   )
14 idn3 37861 . . . . . . . . 9 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑦 = 𝐴   )
15 eleq2 2677 . . . . . . . . . 10 (𝑦 = 𝐴 → (𝑧𝑦𝑧𝐴))
1615biimpcd 238 . . . . . . . . 9 (𝑧𝑦 → (𝑦 = 𝐴𝑧𝐴))
176, 14, 16e23 38003 . . . . . . . 8 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧𝐴   )
182, 17, 11e03 37988 . . . . . . 7 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ,   𝑦 = 𝐴   ▶   𝑧 ∈ suc 𝐴   )
1918in3 37855 . . . . . 6 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   (𝑦 = 𝐴𝑧 ∈ suc 𝐴)   )
20 simpr 476 . . . . . . . 8 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
214, 20e2 37877 . . . . . . 7 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   𝑦 ∈ suc 𝐴   )
22 elsuci 5708 . . . . . . 7 (𝑦 ∈ suc 𝐴 → (𝑦𝐴𝑦 = 𝐴))
2321, 22e2 37877 . . . . . 6 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   (𝑦𝐴𝑦 = 𝐴)   )
24 jao 533 . . . . . 6 ((𝑦𝐴𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
2513, 19, 23, 24e222 37882 . . . . 5 (   Tr 𝐴   ,   (𝑧𝑦𝑦 ∈ suc 𝐴)   ▶   𝑧 ∈ suc 𝐴   )
2625in2 37851 . . . 4 (   Tr 𝐴   ▶   ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
2726gen12 37864 . . 3 (   Tr 𝐴   ▶   𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)   )
28 biimpr 209 . . 3 ((Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴)) → (∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴) → Tr suc 𝐴))
291, 27, 28e01 37937 . 2 (   Tr 𝐴   ▶   Tr suc 𝐴   )
3029in1 37808 1 (Tr 𝐴 → Tr suc 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383  ∀wal 1473   = wceq 1475   ∈ wcel 1977   ⊆ wss 3540  Tr wtr 4680  suc csuc 5642 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-v 3175  df-un 3545  df-in 3547  df-ss 3554  df-sn 4126  df-uni 4373  df-tr 4681  df-suc 5646  df-vd1 37807  df-vd2 37815  df-vd3 37827 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator