| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cotr | Structured version Visualization version GIF version | ||
| Description: Two ways of saying a relation is transitive. Definition of transitivity in [Schechter] p. 51. Special instance of cotrg 6113. (Contributed by NM, 27-Dec-1996.) |
| Ref | Expression |
|---|---|
| cotr | ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cotrg 6113 | 1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1568 ⊆ wss 3906 class class class wbr 5110 ∘ ccom 5667 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-xp 5669 df-rel 5670 df-co 5672 |
| This theorem is referenced by: xpidtr 6124 trin2 6125 dfer2 8696 trclfvcotr 15048 pslem 18629 letsr 18650 dirtr 18659 filnetlem3 36869 dftrrels3 39287 dftrrel3 39289 dfeqvrels3 39300 cotrintab 44320 iunrelexpuztr 44425 |
| Copyright terms: Public domain | W3C validator |