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

Theorem cotr 5666
Description: Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51. Special instance of cotrg 5665. (Contributed by NM, 27-Dec-1996.)
Assertion
Ref Expression
cotr ((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Distinct variable group:   𝑥,𝑦,𝑧,𝑅

Proof of Theorem cotr
StepHypRef Expression
1 cotrg 5665 1 ((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  wal 1630  wss 3715   class class class wbr 4804  ccom 5270
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-rab 3059  df-v 3342  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-br 4805  df-opab 4865  df-xp 5272  df-rel 5273  df-co 5275
This theorem is referenced by:  xpidtr  5676  trin2  5677  dfer2  7914  trclfvcotr  13969  pslem  17427  letsr  17448  dirtr  17457  filnetlem3  32702  cotrintab  38441  iunrelexpuztr  38531
  Copyright terms: Public domain W3C validator