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

Theorem trel3 5156
 Description: In a transitive class, the membership relation is transitive. (Contributed by NM, 19-Apr-1994.)
Assertion
Ref Expression
trel3 (Tr 𝐴 → ((𝐵𝐶𝐶𝐷𝐷𝐴) → 𝐵𝐴))

Proof of Theorem trel3
StepHypRef Expression
1 3anass 1092 . . 3 ((𝐵𝐶𝐶𝐷𝐷𝐴) ↔ (𝐵𝐶 ∧ (𝐶𝐷𝐷𝐴)))
2 trel 5155 . . . 4 (Tr 𝐴 → ((𝐶𝐷𝐷𝐴) → 𝐶𝐴))
32anim2d 614 . . 3 (Tr 𝐴 → ((𝐵𝐶 ∧ (𝐶𝐷𝐷𝐴)) → (𝐵𝐶𝐶𝐴)))
41, 3syl5bi 245 . 2 (Tr 𝐴 → ((𝐵𝐶𝐶𝐷𝐷𝐴) → (𝐵𝐶𝐶𝐴)))
5 trel 5155 . 2 (Tr 𝐴 → ((𝐵𝐶𝐶𝐴) → 𝐵𝐴))
64, 5syld 47 1 (Tr 𝐴 → ((𝐵𝐶𝐶𝐷𝐷𝐴) → 𝐵𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   ∈ wcel 2114  Tr wtr 5148 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-ext 2794 This theorem depends on definitions:  df-bi 210  df-an 400  df-3an 1086  df-ex 1782  df-sb 2070  df-clab 2801  df-cleq 2815  df-clel 2894  df-v 3471  df-in 3915  df-ss 3925  df-uni 4814  df-tr 5149 This theorem is referenced by:  ordelord  6191
 Copyright terms: Public domain W3C validator