Theorem cotr 6133

Description: Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51. Special instance of cotrg 6130. (Contributed by NM, 27-Dec-1996.)

Assertion

Ref	Expression
cotr	⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))

Distinct variable group:   𝑥,𝑦,𝑧,𝑅

Proof of Theorem cotr

Step	Hyp	Ref	Expression
1		cotrg 6130	1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1535   ⊆ wss 3963   class class class wbr 5148   ∘ ccom 5693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-xp 5695  df-rel 5696  df-co 5698

This theorem is referenced by:  xpidtr  6145  trin2  6146  dfer2  8745  trclfvcotr  15045  pslem  18630  letsr  18651  dirtr  18660  filnetlem3  36363  dftrrels3  38558  dftrrel3  38560  dfeqvrels3  38571  cotrintab  43604  iunrelexpuztr  43709