HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem relco 3476
Description: A composition is a relation. Exercise 24 of [TakeutiZaring] p. 25.
Assertion
Ref Expression
relco |- Rel (A o. B)

Proof of Theorem relco
StepHypRef Expression
1 relopab 3261 . 2 |- Rel {<.x, y>. | E.z(xBz /\ zAy)}
2 df-co 3182 . . 3 |- (A o. B) = {<.x, y>. | E.z(xBz /\ zAy)}
32releqi 3239 . 2 |- (Rel (A o. B) <-> Rel {<.x, y>. | E.z(xBz /\ zAy)})
41, 3mpbir 190 1 |- Rel (A o. B)
Colors of variables: wff set class
Syntax hints:   /\ wa 223  E.wex 978   class class class wbr 2614  {copab 2661   o. ccom 3169  Rel wrel 3170
This theorem is referenced by:  cores 3491  resco 3492  cocnvcnv2 3498  cores2 3499  co02 3500  co01 3501  coi1 3502  coass 3504  coexg 3516  funco 3542  cofunexg 3572  fcoi1 3636  fcoi2 3637  cncfmet1 7858  abscncfALT 8291
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-opab 2662  df-xp 3179  df-rel 3180  df-co 3182
Copyright terms: Public domain