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

Theorem brco 2510
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 group(s):   x,A   x,B   x,C   x,D

Proof of Theorem brco
StepHypRef Expression
1 df-br 2063 . 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 2509 . 2 |- (<.A, B>. e. (C o. D) <-> E.x(ADx /\ xCB))
51, 4bitr 151 1 |- (A(C o. D)B <-> E.x(ADx /\ xCB))
Colors of variables: wff set class
Syntax hints:   <-> wb 127   /\ wa 196  E.wex 678   e. wcel 1092  Vcvv 1348  <.cop 1810   class class class wbr 2054   o. ccom 2414
This theorem is referenced by:  funco 2696
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-co 2427
metamath.org