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

Theorem cotr3 13117
 Description: Two ways of saying a relation is transitive. (Contributed by RP, 22-Mar-2020.)
Hypotheses
Ref Expression
cotr3.a
cotr3.b
cotr3.c
Assertion
Ref Expression
cotr3
Distinct variable groups:   ,,,   ,,,   ,,   ,
Allowed substitution hints:   ()   (,)

Proof of Theorem cotr3
StepHypRef Expression
1 cotr3.a . . 3
21eqimss2i 3473 . 2
3 cotr3.b . . . 4
4 cotr3.c . . . . 5
51, 4ineq12i 3623 . . . 4
63, 5eqtri 2493 . . 3
76eqimss2i 3473 . 2
84eqimss2i 3473 . 2
92, 7, 8cotr2 13116 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 189   wa 376   wceq 1452  wral 2756   cin 3389   wss 3390   class class class wbr 4395   cdm 4839   crn 4840   ccom 4843 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-sep 4518  ax-nul 4527  ax-pr 4639 This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-rab 2765  df-v 3033  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-nul 3723  df-if 3873  df-sn 3960  df-pr 3962  df-op 3966  df-br 4396  df-opab 4455  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator