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

Theorem ineq1 3131
Description: Equality theorem for intersection of two classes. (Contributed by NM, 14-Dec-1993.)
Assertion
Ref Expression
ineq1  |-  ( A  =  B  ->  ( A  i^i  C )  =  ( B  i^i  C
) )

Proof of Theorem ineq1
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eleq2 2101 . . . 4  |-  ( A  =  B  ->  (
x  e.  A  <->  x  e.  B ) )
21anbi1d 438 . . 3  |-  ( A  =  B  ->  (
( x  e.  A  /\  x  e.  C
)  <->  ( x  e.  B  /\  x  e.  C ) ) )
3 elin 3126 . . 3  |-  ( x  e.  ( A  i^i  C )  <->  ( x  e.  A  /\  x  e.  C ) )
4 elin 3126 . . 3  |-  ( x  e.  ( B  i^i  C )  <->  ( x  e.  B  /\  x  e.  C ) )
52, 3, 43bitr4g 212 . 2  |-  ( A  =  B  ->  (
x  e.  ( A  i^i  C )  <->  x  e.  ( B  i^i  C ) ) )
65eqrdv 2038 1  |-  ( A  =  B  ->  ( A  i^i  C )  =  ( B  i^i  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    = wceq 1243    e. wcel 1393    i^i cin 2916
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-in 2924
This theorem is referenced by:  ineq2  3132  ineq12  3133  ineq1i  3134  ineq1d  3137  dfrab3ss  3215  intprg  3648  inex1g  3893  reseq1  4606  uzin2  9586  bdinex1g  10021
  Copyright terms: Public domain W3C validator