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

Theorem brxp 4780
Description: Binary relation on a cross product. (Contributed by NM, 22-Apr-2004.)
Assertion
Ref Expression
brxp  |-  ( A ( C  X.  D
) B  <->  ( A  e.  C  /\  B  e.  D ) )

Proof of Theorem brxp
StepHypRef Expression
1 df-br 4110 . 2  |-  ( A ( C  X.  D
) B  <->  <. A ,  B >.  e.  ( C  X.  D ) )
2 opelxp 4779 . 2  |-  ( <. A ,  B >.  e.  ( C  X.  D
)  <->  ( A  e.  C  /\  B  e.  D ) )
31, 2bitri 184 1  |-  ( A ( C  X.  D
) B  <->  ( A  e.  C  /\  B  e.  D ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    e. wcel 2203   <.cop 3692   class class class wbr 4109    X. cxp 4747
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 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-xp 4755
This theorem is referenced by:  brrelex12  4788  brel  4802  brinxp2  4817  eqbrrdva  4925  ssrelrn  4947  xpidtr  5153  xpcom  5309  tpostpos  6495  swoer  6795  erinxp  6843  ecopover  6867  ecopoverg  6870  ltxrlt  8339  ltxr  10108  znleval  14801
  Copyright terms: Public domain W3C validator