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

Theorem suctrALT3 41466
 Description: The successor of a transitive class is transitive. suctrALT3 41466 is the completed proof in conventional notation of the Virtual Deduction proof https://us.metamath.org/other/completeusersproof/suctralt3vd.html 41466. It was completed manually. The potential for automated derivation from the VD proof exists. See wvd1 41111 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 41108). 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 5155) . (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.
StepHypRef Expression
1 sssucid 6249 . . . . . . . . 9 𝐴 ⊆ suc 𝐴
2 id 22 . . . . . . . . . 10 (Tr 𝐴 → Tr 𝐴)
3 id 22 . . . . . . . . . . 11 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑧𝑦𝑦 ∈ suc 𝐴))
43simpld 498 . . . . . . . . . 10 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦)
5 id 22 . . . . . . . . . 10 (𝑦𝐴𝑦𝐴)
62, 4, 5trelded 41107 . . . . . . . . 9 ((Tr 𝐴 ∧ (𝑧𝑦𝑦 ∈ suc 𝐴) ∧ 𝑦𝐴) → 𝑧𝐴)
71, 6sseldi 3949 . . . . . . . 8 ((Tr 𝐴 ∧ (𝑧𝑦𝑦 ∈ suc 𝐴) ∧ 𝑦𝐴) → 𝑧 ∈ suc 𝐴)
873expia 1118 . . . . . . 7 ((Tr 𝐴 ∧ (𝑧𝑦𝑦 ∈ suc 𝐴)) → (𝑦𝐴𝑧 ∈ suc 𝐴))
9 id 22 . . . . . . . . . 10 (𝑦 = 𝐴𝑦 = 𝐴)
10 eleq2 2904 . . . . . . . . . . 11 (𝑦 = 𝐴 → (𝑧𝑦𝑧𝐴))
1110biimpac 482 . . . . . . . . . 10 ((𝑧𝑦𝑦 = 𝐴) → 𝑧𝐴)
124, 9, 11syl2an 598 . . . . . . . . 9 (((𝑧𝑦𝑦 ∈ suc 𝐴) ∧ 𝑦 = 𝐴) → 𝑧𝐴)
131, 12sseldi 3949 . . . . . . . 8 (((𝑧𝑦𝑦 ∈ suc 𝐴) ∧ 𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)
1413ex 416 . . . . . . 7 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧 ∈ suc 𝐴))
153simprd 499 . . . . . . . 8 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
16 elsuci 6238 . . . . . . . 8 (𝑦 ∈ suc 𝐴 → (𝑦𝐴𝑦 = 𝐴))
1715, 16syl 17 . . . . . . 7 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑦 = 𝐴))
188, 14, 17jaoded 41108 . . . . . 6 (((Tr 𝐴 ∧ (𝑧𝑦𝑦 ∈ suc 𝐴)) ∧ (𝑧𝑦𝑦 ∈ suc 𝐴) ∧ (𝑧𝑦𝑦 ∈ suc 𝐴)) → 𝑧 ∈ suc 𝐴)
1918un2122 41332 . . . . 5 ((Tr 𝐴 ∧ (𝑧𝑦𝑦 ∈ suc 𝐴)) → 𝑧 ∈ suc 𝐴)
2019ex 416 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2120alrimivv 1930 . . 3 (Tr 𝐴 → ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
22 dftr2 5155 . . . 4 (Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2322biimpri 231 . . 3 (∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴) → Tr suc 𝐴)
2421, 23syl 17 . 2 (Tr 𝐴 → Tr suc 𝐴)
2524idiALT 41019 1 (Tr 𝐴 → Tr suc 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∨ wo 844   ∧ w3a 1084  ∀wal 1536   = wceq 1538   ∈ wcel 2115  Tr wtr 5153  suc csuc 6174 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-v 3481  df-un 3923  df-in 3925  df-ss 3935  df-sn 4549  df-uni 4820  df-tr 5154  df-suc 6178 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator