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

Theorem ineq1d 1644
Description: Equality deduction for intersection of two classes.
Hypothesis
Ref Expression
ineq1d.1 |- (ph -> A = B)
Assertion
Ref Expression
ineq1d |- (ph -> (A i^i C) = (B i^i C))

Proof of Theorem ineq1d
StepHypRef Expression
1 ineq1d.1 . 2 |- (ph -> A = B)
2 ineq1 1638 . 2 |- (A = B -> (A i^i C) = (B i^i C))
31, 2syl 12 1 |- (ph -> (A i^i C) = (B i^i C))
Colors of variables: wff set class
Syntax hints:   -> wi 2   = wceq 1091   i^i cin 1486
This theorem is referenced by:  ineq12d 1646  fnresdisj 2732  fiint 3445  kmlem11 3590  chdmj2t 5443  cmcmlem 5500  mdbr 5726  mdi 5727  mdbr3 5729  mdbr4 5730  dmdbr 5731
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-v 1349  df-in 1491
metamath.org