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

Theorem reseq1d 5064
Description: Equality deduction for restrictions. (Contributed by NM, 21-Oct-2014.)
Hypothesis
Ref Expression
reseqd.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
reseq1d  |-  ( ph  ->  ( A  |`  C )  =  ( B  |`  C ) )

Proof of Theorem reseq1d
StepHypRef Expression
1 reseqd.1 . 2  |-  ( ph  ->  A  =  B )
2 reseq1 5059 . 2  |-  ( A  =  B  ->  ( A  |`  C )  =  ( B  |`  C ) )
31, 2syl 14 1  |-  ( ph  ->  ( A  |`  C )  =  ( B  |`  C ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    |` cres 4778
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-in 3226  df-res 4788
This theorem is used by:  reseq12d  5066  fun2ssres  5424  funcnvres2  5459  funimaexg  5468  fresin  5571  offres  6372  tfrlemisucaccv  6600  tfrlemi1  6607  tfr1onlemsucaccv  6616  tfrcllemsucaccv  6629  freceq1  6667  freceq2  6668  fseq1p1m1  10518  setsresg  13448  setscom  13450  gsumsplitfi  14256  gsum2dfilem2  14272  znle2  15096  dvcoapbr  15933  bj-charfundcALT  17040
  Copyright terms: Public domain W3C validator