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

Theorem suctrALT2 39386
Description: Virtual deduction proof of suctr 5846. The sucessor of a transitive class is transitive. This proof was generated automatically from the virtual deduction proof suctrALT2VD 39385 using the tools command file translatewithout_overwritingminimize_excludingduplicates.cmd . (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
suctrALT2 (Tr 𝐴 → Tr suc 𝐴)

Proof of Theorem suctrALT2
Dummy variables 𝑧 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sssucid 5840 . . . . 5 𝐴 ⊆ suc 𝐴
2 trel 4792 . . . . . . 7 (Tr 𝐴 → ((𝑧𝑦𝑦𝐴) → 𝑧𝐴))
32expd 451 . . . . . 6 (Tr 𝐴 → (𝑧𝑦 → (𝑦𝐴𝑧𝐴)))
43adantrd 483 . . . . 5 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧𝐴)))
5 ssel 3630 . . . . 5 (𝐴 ⊆ suc 𝐴 → (𝑧𝐴𝑧 ∈ suc 𝐴))
61, 4, 5ee03 39285 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧 ∈ suc 𝐴)))
7 simpl 472 . . . . . . 7 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦)
87a1i 11 . . . . . 6 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦))
9 eleq2 2719 . . . . . . 7 (𝑦 = 𝐴 → (𝑧𝑦𝑧𝐴))
109biimpcd 239 . . . . . 6 (𝑧𝑦 → (𝑦 = 𝐴𝑧𝐴))
118, 10syl6 35 . . . . 5 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧𝐴)))
121, 11, 5ee03 39285 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧 ∈ suc 𝐴)))
13 simpr 476 . . . . . 6 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
1413a1i 11 . . . . 5 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴))
15 elsuci 5829 . . . . 5 (𝑦 ∈ suc 𝐴 → (𝑦𝐴𝑦 = 𝐴))
1614, 15syl6 35 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑦 = 𝐴)))
17 jao 533 . . . 4 ((𝑦𝐴𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
186, 12, 16, 17ee222 39025 . . 3 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
1918alrimivv 1896 . 2 (Tr 𝐴 → ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
20 dftr2 4787 . 2 (Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2119, 20sylibr 224 1 (Tr 𝐴 → Tr suc 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 382  wa 383  wal 1521   = wceq 1523  wcel 2030  wss 3607  Tr wtr 4785  suc csuc 5763
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-v 3233  df-un 3612  df-in 3614  df-ss 3621  df-sn 4211  df-uni 4469  df-tr 4786  df-suc 5767
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator