| 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 15009. (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 4162 | . . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) = (ran 𝑅 ∩ dom 𝑅) | |
| 3 | cotr2.b | . . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵 | |
| 4 | 2, 3 | eqsstrri 3984 | . 2 ⊢ (ran 𝑅 ∩ dom 𝑅) ⊆ 𝐵 |
| 5 | cotr2.c | . 2 ⊢ ran 𝑅 ⊆ 𝐶 | |
| 6 | 1, 4, 5 | cotr2g 15009 | 1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wral 3079 ∩ cin 3904 ⊆ wss 3905 class class class wbr 5109 dom cdm 5661 ran crn 5662 ∘ ccom 5665 |
| 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-12 2213 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| 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-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 |
| This theorem is referenced by: cotr3 15011 |
| Copyright terms: Public domain | W3C validator |