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

Theorem brxp 4642
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 3990 . 2  |-  ( A ( C  X.  D
) B  <->  <. A ,  B >.  e.  ( C  X.  D ) )
2 opelxp 4641 . 2  |-  ( <. A ,  B >.  e.  ( C  X.  D
)  <->  ( A  e.  C  /\  B  e.  D ) )
31, 2bitri 183 1  |-  ( A ( C  X.  D
) B  <->  ( A  e.  C  /\  B  e.  D ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    e. wcel 2141   <.cop 3586   class class class wbr 3989    X. cxp 4609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617
This theorem is referenced by:  brrelex12  4649  brel  4663  brinxp2  4678  eqbrrdva  4781  xpidtr  5001  xpcom  5157  tpostpos  6243  swoer  6541  erinxp  6587  ecopover  6611  ecopoverg  6614  ltxrlt  7985  ltxr  9732
  Copyright terms: Public domain W3C validator