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

Theorem xpindi 4910
Description: Distributive law for cross product over intersection. Theorem 102 of [Suppes] p. 52. (Contributed by NM, 26-Sep-2004.)
Assertion
Ref Expression
xpindi  |-  ( A  X.  ( B  i^i  C ) )  =  ( ( A  X.  B
)  i^i  ( A  X.  C ) )

Proof of Theorem xpindi
StepHypRef Expression
1 inxp 4909 . 2  |-  ( ( A  X.  B )  i^i  ( A  X.  C ) )  =  ( ( A  i^i  A )  X.  ( B  i^i  C ) )
2 inidm 3440 . . 3  |-  ( A  i^i  A )  =  A
32xpeq1i 4789 . 2  |-  ( ( A  i^i  A )  X.  ( B  i^i  C ) )  =  ( A  X.  ( B  i^i  C ) )
41, 3eqtr2i 2260 1  |-  ( A  X.  ( B  i^i  C ) )  =  ( ( A  X.  B
)  i^i  ( A  X.  C ) )
Colors of variables: wff set class
Syntax hints:    = wceq 1402    i^i cin 3219    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-opab 4188  df-xp 4775  df-rel 4776
This theorem is referenced by:  xpriindim  4913  djuassen  7563  xpdjuen  7564
  Copyright terms: Public domain W3C validator