| 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 6116. (Contributed by NM, 27-Dec-1996.) |
| Ref | Expression |
|---|---|
| cotr | ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cotrg 6116 | 1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 ⊆ wss 3908 class class class wbr 5114 ∘ ccom 5670 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 df-rel 5673 df-co 5675 |
| This theorem is used by: xpidtr 6127 trin2 6128 dfer2 8704 trclfvcotr 15072 pslem 18653 letsr 18674 dirtr 18683 filnetlem3 36932 dftrrels3 39350 dftrrel3 39352 dfeqvrels3 39363 cotrintab 44381 iunrelexpuztr 44486 |
| Copyright terms: Public domain | W3C validator |