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

Theorem fveqres 3749
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 3734 . . . 4 |- (A e. B -> ((F |` B)` A) = (F` A))
2 fvres 3734 . . . 4 |- (A e. B -> ((G |` B)` A) = (G` A))
31, 2eqeq12d 1489 . . 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 3748 . . . 4 |- (-. A e. B -> ((F |` B)` A) = (/))
6 nfvres 3748 . . . 4 |- (-. A e. B -> ((G |` B)` A) = (/))
75, 6eqtr4d 1510 . . 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 956   e. wcel 958  (/)c0 2280   |` cres 3172  ` cfv 3182
This theorem is referenced by:  fvresex 3857
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-xp 3184  df-rel 3185  df-cnv 3186  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fv 3198
Copyright terms: Public domain