| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cotr2 | Structured version Visualization version GIF version | ||
| Description: Two ways of saying a relation is transitive. Special instance of cotr2g 14911. (Contributed by RP, 22-Mar-2020.) |
| Ref | Expression |
|---|---|
| cotr2.a | ⊢ dom 𝑅 ⊆ 𝐴 |
| cotr2.b | ⊢ (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵 |
| cotr2.c | ⊢ ran 𝑅 ⊆ 𝐶 |
| Ref | Expression |
|---|---|
| cotr2 | ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cotr2.a | . 2 ⊢ dom 𝑅 ⊆ 𝐴 | |
| 2 | incom 4163 | . . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) = (ran 𝑅 ∩ dom 𝑅) | |
| 3 | cotr2.b | . . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵 | |
| 4 | 2, 3 | eqsstrri 3983 | . 2 ⊢ (ran 𝑅 ∩ dom 𝑅) ⊆ 𝐵 |
| 5 | cotr2.c | . 2 ⊢ ran 𝑅 ⊆ 𝐶 | |
| 6 | 1, 4, 5 | cotr2g 14911 | 1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wral 3052 ∩ cin 3902 ⊆ wss 3903 class class class wbr 5100 dom cdm 5632 ran crn 5633 ∘ ccom 5636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 |
| This theorem is referenced by: cotr3 14913 |
| Copyright terms: Public domain | W3C validator |