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

Theorem iineq1 3984
Description: Equality theorem for restricted existential quantifier. (Contributed by NM, 27-Jun-1998.)
Assertion
Ref Expression
iineq1  |-  ( A  =  B  ->  |^|_ x  e.  A  C  =  |^|_
x  e.  B  C
)
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    C( x)

Proof of Theorem iineq1
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 raleq 2730 . . 3  |-  ( A  =  B  ->  ( A. x  e.  A  y  e.  C  <->  A. x  e.  B  y  e.  C ) )
21abbidv 2349 . 2  |-  ( A  =  B  ->  { y  |  A. x  e.  A  y  e.  C }  =  { y  |  A. x  e.  B  y  e.  C }
)
3 df-iin 3973 . 2  |-  |^|_ x  e.  A  C  =  { y  |  A. x  e.  A  y  e.  C }
4 df-iin 3973 . 2  |-  |^|_ x  e.  B  C  =  { y  |  A. x  e.  B  y  e.  C }
52, 3, 43eqtr4g 2289 1  |-  ( A  =  B  ->  |^|_ x  e.  A  C  =  |^|_
x  e.  B  C
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   {cab 2217   A.wral 2510   |^|_ciin 3971
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-iin 3973
This theorem is referenced by:  riin0  4042  iin0r  4259
  Copyright terms: Public domain W3C validator