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

Theorem fveqres 3688
Description: Equal values imply equal values in a restriction.
Assertion
Ref Expression
fveqres |- ((F` A) = (G` A) -> ((F |` B)` A) = ((G |` B)` A))

Proof of Theorem fveqres
StepHypRef Expression
1 fvres 3673 . . . 4 |- (A e. B -> ((F |` B)` A) = (F` A))
2 fvres 3673 . . . 4 |- (A e. B -> ((G |` B)` A) = (G` A))
31, 2eqeq12d 1465 . . 3 |- (A e. B -> (((F |` B)` A) = ((G |` B)` A) <-> (F` A) = (G` A)))
43biimprd 154 . 2 |- (A e. B -> ((F` A) = (G` A) -> ((F |` B)` A) = ((G |` B)` A)))
5 nfvres 3687 . . . 4 |- (-. A e. B -> ((F |` B)` A) = (/))
6 nfvres 3687 . . . 4 |- (-. A e. B -> ((G |` B)` A) = (/))
75, 6eqtr4d 1486 . . 3 |- (-. A e. B -> ((F |` B)` A) = ((G |` B)` A))
87a1d 12 . 2 |- (-. A e. B -> ((F` A) = (G` A) -> ((F |` B)` A) = ((G |` B)` A)))
94, 8pm2.61i 126 1 |- ((F` A) = (G` A) -> ((F |` B)` A) = ((G |` B)` A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   = wceq 1099   e. wcel 1105  (/)c0 2251   |` cres 3135  ` cfv 3145
This theorem is referenced by:  fvresex 3796
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-13 1107  ax-14 1108  ax-11 1180  ax-17 1190  ax-16 1194  ax-11o 1202  ax-ext 1436  ax-sep 2671  ax-nul 2678  ax-pow 2710  ax-pr 2747
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 957  df-sb 1155  df-eu 1359  df-mo 1360  df-clab 1441  df-cleq 1446  df-clel 1449  df-ne 1563  df-ral 1625  df-rex 1626  df-v 1787  df-dif 2020  df-un 2021  df-in 2022  df-ss 2024  df-nul 2252  df-pw 2373  df-sn 2383  df-pr 2384  df-op 2387  df-uni 2472  df-br 2588  df-opab 2635  df-xp 3147  df-rel 3148  df-cnv 3149  df-dm 3151  df-rn 3152  df-res 3153  df-ima 3154  df-fv 3161
Copyright terms: Public domain