ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brco Unicode version

Theorem brco 4931
Description: Binary relation on a composition. (Contributed by NM, 21-Sep-2004.) (Revised by Mario Carneiro, 24-Feb-2015.)
Hypotheses
Ref Expression
opelco.1  |-  A  e. 
_V
opelco.2  |-  B  e. 
_V
Assertion
Ref Expression
brco  |-  ( A ( C  o.  D
) B  <->  E. x
( A D x  /\  x C B ) )
Distinct variable groups:    x, A    x, B    x, C    x, D

Proof of Theorem brco
StepHypRef Expression
1 opelco.1 . 2  |-  A  e. 
_V
2 opelco.2 . 2  |-  B  e. 
_V
3 brcog 4927 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( A ( C  o.  D ) B  <->  E. x ( A D x  /\  x C B ) ) )
41, 2, 3mp2an 426 1  |-  ( A ( C  o.  D
) B  <->  E. x
( A D x  /\  x C B ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105   E.wex 1541    e. wcel 2205   _Vcvv 2815   class class class wbr 4114    o. ccom 4758
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-co 4763
This theorem is referenced by:  opelco  4932  cnvco  4945  resco  5272  imaco  5273  rnco  5274  coass  5286  f1eqcocnv  5970
  Copyright terms: Public domain W3C validator