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

Theorem brco 3289
Description: Binary relation on a composition.
Hypotheses
Ref Expression
opelco.1 |- A e. V
opelco.2 |- B e. V
Assertion
Ref Expression
brco |- (A(C o. D)B <-> E.x(ADx /\ xCB))
Distinct variable groups:   x,A   x,B   x,C   x,D

Proof of Theorem brco
StepHypRef Expression
1 df-br 2620 . 2 |- (A(C o. D)B <-> <.A, B>. e. (C o. D))
2 opelco.1 . . 3 |- A e. V
3 opelco.2 . . 3 |- B e. V
42, 3opelco 3288 . 2 |- (<.A, B>. e. (C o. D) <-> E.x(ADx /\ xCB))
51, 4bitr 173 1 |- (A(C o. D)B <-> E.x(ADx /\ xCB))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   e. wcel 958  E.wex 980  Vcvv 1811  <.cop 2411   class class class wbr 2619   o. ccom 3174
This theorem is referenced by:  resco 3500  imaco 3501  rnco 3502  funco 3550
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-br 2620  df-opab 2667  df-co 3187
Copyright terms: Public domain