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

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

Proof of Theorem cotr
StepHypRef Expression
1 cotrg 6103 1 ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ⊆ wss 3899   class class class wbr 5103   ∘ ccom 5655
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-co 5660
This theorem is used by:  xpidtr  6114  trin2  6115  dfer2  8702  trclfvcotr  15142  pslem  18726  letsr  18747  dirtr  18756  filnetlem3  37138  dftrrels3  39560  dftrrel3  39562  dfeqvrels3  39573  cotrintab  44573  iunrelexpuztr  44678
  Copyright terms: Public domain W3C validator