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

Theorem fveqres 3755
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 3740 . . . 4 |- (A e. B -> ((F |` B)` A) = (F` A))
2 fvres 3740 . . . 4 |- (A e. B -> ((G |` B)` A) = (G` A))
31, 2eqeq12d 1492 . . 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 3754 . . . 4 |- (-. A e. B -> ((F |` B)` A) = (/))
6 nfvres 3754 . . . 4 |- (-. A e. B -> ((G |` B)` A) = (/))
75, 6eqtr4d 1513 . . 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 958   e. wcel 960  (/)c0 2283   |` cres 3178  ` cfv 3188
This theorem is referenced by:  fvresex 3863
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-xp 3190  df-rel 3191  df-cnv 3192  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fv 3204
Copyright terms: Public domain