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

Theorem uneq1d 3374
Description: Deduction adding union to the right in a class equality. (Contributed by NM, 29-Mar-1998.)
Hypothesis
Ref Expression
uneq1d.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
uneq1d  |-  ( ph  ->  ( A  u.  C
)  =  ( B  u.  C ) )

Proof of Theorem uneq1d
StepHypRef Expression
1 uneq1d.1 . 2  |-  ( ph  ->  A  =  B )
2 uneq1 3368 . 2  |-  ( A  =  B  ->  ( A  u.  C )  =  ( B  u.  C ) )
31, 2syl 14 1  |-  ( ph  ->  ( A  u.  C
)  =  ( B  u.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    u. cun 3211
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-un 3217
This theorem is referenced by:  ifeq1  3627  preq1  3770  tpeq1  3779  tpeq2  3780  resasplitss  5546  fmptpr  5878  funresdfunsnss  5889  rdgisucinc  6618  oasuc  6699  omsuc  6707  funresdfunsndc  6741  fisseneq  7197  sbthlemi5  7233  exmidfodomrlemim  7506  fzpred  10408  fseq1p1m1  10432  nn0split  10474  nnsplit  10475  fzo0sn0fzo1  10570  fzosplitpr  10583  fzosplitprm1  10584  zsupcllemstep  10593  hashfibclem  11210  fsum1p  12108  fprod1p  12289  setsvala  13260  setsabsd  13268  setscom  13269  prdsex  13499  prdsval  13503  plyaddlem1  15629  plymullem1  15630
  Copyright terms: Public domain W3C validator