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

Theorem cotr2 14921
Description: Two ways of saying a relation is transitive. Special instance of cotr2g 14920. (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 4201 . . 3 (dom 𝑅 ∩ ran 𝑅) = (ran 𝑅 ∩ dom 𝑅)
3 cotr2.b . . 3 (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵
42, 3eqsstrri 4017 . 2 (ran 𝑅 ∩ dom 𝑅) ⊆ 𝐵
5 cotr2.c . 2 ran 𝑅𝐶
61, 4, 5cotr2g 14920 1 ((𝑅𝑅) ⊆ 𝑅 ↔ ∀𝑥𝐴𝑦𝐵𝑧𝐶 ((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397  wral 3062  cin 3947  wss 3948   class class class wbr 5148  dom cdm 5676  ran crn 5677  ccom 5680
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-12 2172  ax-ext 2704  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rab 3434  df-v 3477  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687
This theorem is referenced by:  cotr3  14922
  Copyright terms: Public domain W3C validator