MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cotr2 Structured version   Visualization version   GIF version

Theorem cotr2 14891
Description: Two ways of saying a relation is transitive. Special instance of cotr2g 14890. (Contributed by RP, 22-Mar-2020.)
Hypotheses
Ref Expression
cotr2.a dom 𝑅𝐴
cotr2.b (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵
cotr2.c ran 𝑅𝐶
Assertion
Ref Expression
cotr2 ((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑅   𝑥,𝐴,𝑦,𝑧   𝑦,𝐵,𝑧   𝑧,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥,𝑦)

Proof of Theorem cotr2
StepHypRef Expression
1 cotr2.a . 2 dom 𝑅𝐴
2 incom 4158 . . 3 (dom 𝑅 ∩ ran 𝑅) = (ran 𝑅 ∩ dom 𝑅)
3 cotr2.b . . 3 (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵
42, 3eqsstrri 3978 . 2 (ran 𝑅 ∩ dom 𝑅) ⊆ 𝐵
5 cotr2.c . 2 ran 𝑅𝐶
61, 4, 5cotr2g 14890 1 ((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wral 3048  cin 3897  wss 3898   class class class wbr 5095  dom cdm 5621  ran crn 5622  ccom 5625
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-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
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-nf 1785  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5096  df-opab 5158  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632
This theorem is referenced by:  cotr3  14892
  Copyright terms: Public domain W3C validator