| 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 6068. (Contributed by NM, 27-Dec-1996.) |
| Ref | Expression |
|---|---|
| cotr | ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cotrg 6068 | 1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1539 ⊆ wss 3901 class class class wbr 5098 ∘ ccom 5628 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-xp 5630 df-rel 5631 df-co 5633 |
| This theorem is referenced by: xpidtr 6079 trin2 6080 dfer2 8636 trclfvcotr 14932 pslem 18495 letsr 18516 dirtr 18525 filnetlem3 36574 dftrrels3 38829 dftrrel3 38831 dfeqvrels3 38842 cotrintab 43851 iunrelexpuztr 43956 |
| Copyright terms: Public domain | W3C validator |