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

Theorem in31 3180
Description: A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.)
Assertion
Ref Expression
in31  |-  ( ( A  i^i  B )  i^i  C )  =  ( ( C  i^i  B )  i^i  A )

Proof of Theorem in31
StepHypRef Expression
1 in12 3177 . 2  |-  ( C  i^i  ( A  i^i  B ) )  =  ( A  i^i  ( C  i^i  B ) )
2 incom 3158 . 2  |-  ( ( A  i^i  B )  i^i  C )  =  ( C  i^i  ( A  i^i  B ) )
3 incom 3158 . 2  |-  ( ( C  i^i  B )  i^i  A )  =  ( A  i^i  ( C  i^i  B ) )
41, 2, 33eqtr4i 2111 1  |-  ( ( A  i^i  B )  i^i  C )  =  ( ( C  i^i  B )  i^i  A )
Colors of variables: wff set class
Syntax hints:    = wceq 1284    i^i cin 2972
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-in 2979
This theorem is referenced by:  inrot  3181
  Copyright terms: Public domain W3C validator