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

Theorem relco 3484
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 3266 . 2 |- Rel {<.x, y>. | E.z(xBz /\ zAy)}
2 df-co 3187 . . 3 |- (A o. B) = {<.x, y>. | E.z(xBz /\ zAy)}
32releqi 3244 . 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 980   class class class wbr 2619  {copab 2666   o. ccom 3174  Rel wrel 3175
This theorem is referenced by:  cores 3499  resco 3500  cocnvcnv2 3506  cores2 3507  co02 3508  co01 3509  coi1 3510  coass 3512  coexg 3524  funco 3550  cofunexg 3580  fcoi1 3645  fcoi2 3646  cncfmet1 7906  abscncfALT 8344
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-opab 2667  df-xp 3184  df-rel 3185  df-co 3187
Copyright terms: Public domain