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

Theorem in4 3829
Description: Rearrangement of intersection of 4 classes. (Contributed by NM, 21-Apr-2001.)
Assertion
Ref Expression
in4  |-  ( ( A  i^i  B )  i^i  ( C  i^i  D ) )  =  ( ( A  i^i  C
)  i^i  ( B  i^i  D ) )

Proof of Theorem in4
StepHypRef Expression
1 in12 3824 . . 3  |-  ( B  i^i  ( C  i^i  D ) )  =  ( C  i^i  ( B  i^i  D ) )
21ineq2i 3811 . 2  |-  ( A  i^i  ( B  i^i  ( C  i^i  D ) ) )  =  ( A  i^i  ( C  i^i  ( B  i^i  D ) ) )
3 inass 3823 . 2  |-  ( ( A  i^i  B )  i^i  ( C  i^i  D ) )  =  ( A  i^i  ( B  i^i  ( C  i^i  D ) ) )
4 inass 3823 . 2  |-  ( ( A  i^i  C )  i^i  ( B  i^i  D ) )  =  ( A  i^i  ( C  i^i  ( B  i^i  D ) ) )
52, 3, 43eqtr4i 2654 1  |-  ( ( A  i^i  B )  i^i  ( C  i^i  D ) )  =  ( ( A  i^i  C
)  i^i  ( B  i^i  D ) )
Colors of variables: wff setvar class
Syntax hints:    = wceq 1483    i^i cin 3573
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
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  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-v 3202  df-in 3581
This theorem is referenced by:  inindi  3830  inindir  3831  fh2  28478  disjxpin  29401
  Copyright terms: Public domain W3C validator