Table of ContentsTable of Contents Mathbox for Paul Chapman < Previous   Next >
Related theorems
Unicode version

Theorem reseq2d 13592
Description: Equality deduction for restrictions.
Hypothesis
Ref Expression
reseq2d.1 |- (ph -> A = B)
Assertion
Ref Expression
reseq2d |- (ph -> (F |` A) = (F |` B))

Proof of Theorem reseq2d
StepHypRef Expression
1 reseq2d.1 . 2 |- (ph -> A = B)
2 reseq2 4219 . 2 |- (A = B -> (F |` A) = (F |` B))
31, 2syl 12 1 |- (ph -> (F |` A) = (F |` B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 1298   |` cres 3988
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-v 2294  df-in 2603  df-opab 3396  df-xp 4000  df-res 4006
Copyright terms: Public domain