MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  suctrOLD Structured version   Visualization version   GIF version

Theorem suctrOLD 5726
Description: Obsolete proof of suctr 5725 as of 24-Sep-2021. (Contributed by Alan Sare, 11-Apr-2009.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
suctrOLD (Tr 𝐴 → Tr suc 𝐴)

Proof of Theorem suctrOLD
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 476 . . . . 5 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
2 vex 3176 . . . . . 6 𝑦 ∈ V
32elsuc 5711 . . . . 5 (𝑦 ∈ suc 𝐴 ↔ (𝑦𝐴𝑦 = 𝐴))
41, 3sylib 207 . . . 4 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑦 = 𝐴))
5 simpl 472 . . . . . . 7 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦)
6 eleq2 2677 . . . . . . 7 (𝑦 = 𝐴 → (𝑧𝑦𝑧𝐴))
75, 6syl5ibcom 234 . . . . . 6 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧𝐴))
8 elelsuc 5714 . . . . . 6 (𝑧𝐴𝑧 ∈ suc 𝐴)
97, 8syl6 34 . . . . 5 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧 ∈ suc 𝐴))
10 trel 4687 . . . . . . . . 9 (Tr 𝐴 → ((𝑧𝑦𝑦𝐴) → 𝑧𝐴))
1110expd 451 . . . . . . . 8 (Tr 𝐴 → (𝑧𝑦 → (𝑦𝐴𝑧𝐴)))
1211adantrd 483 . . . . . . 7 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧𝐴)))
1312, 8syl8 74 . . . . . 6 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧 ∈ suc 𝐴)))
14 jao 533 . . . . . 6 ((𝑦𝐴𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
1513, 14syl6 34 . . . . 5 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴))))
169, 15mpdi 44 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
174, 16mpdi 44 . . 3 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
1817alrimivv 1843 . 2 (Tr 𝐴 → ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
19 dftr2 4682 . 2 (Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2018, 19sylibr 223 1 (Tr 𝐴 → Tr suc 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 382  wa 383  wal 1473   = wceq 1475  wcel 1977  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-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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator