HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iineq1 2004
Description: Equality theorem for restricted existential quantifier.
Assertion
Ref Expression
iineq1 |- (A = B -> |^|x e. A C = |^|x e. B C)
Distinct variable group(s):   x,A   x,B

Proof of Theorem iineq1
StepHypRef Expression
1 raleq 1324 . . 3 |- (A = B -> (A.x e. A y e. C <-> A.x e. B y e. C))
21biabdv 1183 . 2 |- (A = B -> {y | A.x e. A y e. C} = {y | A.x e. B y e. C})
3 df-iin 1997 . 2 |- |^|x e. A C = {y | A.x e. A y e. C}
4 df-iin 1997 . 2 |- |^|x e. B C = {y | A.x e. B y e. C}
52, 3, 43eqtr4g 1147 1 |- (A = B -> |^|x e. A C = |^|x e. B C)
Colors of variables: wff set class
Syntax hints:   -> wi 2  {cab 1090   = wceq 1091   e. wcel 1092  A.wral 1201  |^|ciin 1995
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-iin 1997
metamath.org