MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xpindi Structured version   Visualization version   Unicode version

Theorem xpindi 5255
Description: Distributive law for Cartesian 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 5254 . 2  |-  ( ( A  X.  B )  i^i  ( A  X.  C ) )  =  ( ( A  i^i  A )  X.  ( B  i^i  C ) )
2 inidm 3822 . . 3  |-  ( A  i^i  A )  =  A
32xpeq1i 5135 . 2  |-  ( ( A  i^i  A )  X.  ( B  i^i  C ) )  =  ( A  X.  ( B  i^i  C ) )
41, 3eqtr2i 2645 1  |-  ( A  X.  ( B  i^i  C ) )  =  ( ( A  X.  B
)  i^i  ( A  X.  C ) )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1483    i^i cin 3573    X. cxp 5112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-opab 4713  df-xp 5120  df-rel 5121
This theorem is referenced by:  xpriindi  5258  xpcdaen  9005  fpwwe2lem13  9464  txhaus  21450  ustund  22025
  Copyright terms: Public domain W3C validator