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

Theorem brxp 4800
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 4126 . 2  |-  ( A ( C  X.  D
) B  <->  <. A ,  B >.  e.  ( C  X.  D ) )
2 opelxp 4799 . 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 2209   <.cop 3708   class class class wbr 4125    X. cxp 4767
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-xp 4775
This theorem is referenced by:  brrelex12  4808  brel  4822  brinxp2  4837  eqbrrdva  4945  ssrelrn  4967  xpidtr  5173  xpcom  5329  tpostpos  6525  swoer  6825  erinxp  6873  ecopover  6897  ecopoverg  6900  ltxrlt  8381  ltxr  10156  znleval  14960
  Copyright terms: Public domain W3C validator