Theorem reseq12i 4956

Description: Equality inference for restrictions. (Contributed by NM, 21-Oct-2014.)

Hypotheses

Ref	Expression
reseqi.1	|- A = B
reseqi.2	|- C = D

Assertion

Ref	Expression
reseq12i	|- ( A |` C ) = ( B |` D )

Proof of Theorem reseq12i

Step	Hyp	Ref	Expression
1		reseqi.1	. . 3 |- A = B
2	1	reseq1i 4954	. 2 |- ( A |` C ) = ( B |` C )
3		reseqi.2	. . 3 |- C = D
4	3	reseq2i 4955	. 2 |- ( B |` C ) = ( B |` D )
5	2, 4	eqtri 2225	1 |- ( A |` C ) = ( B |` D )

Syntax hints:   = wceq 1372   |` cres 4676

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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186

This theorem depends on definitions:  df-bi 117  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-v 2773  df-in 3171  df-opab 4105  df-xp 4680  df-res 4686

This theorem is referenced by:  cnvresid  5347