| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Equal values imply equal values in a restriction. |
| Ref | Expression |
|---|---|
| fveqres | ⊢ ((F ‘A) = (G ‘A) → ((F ↾ B) ‘A) = ((G ↾ B) ‘A)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvres 3725 | . . . 4 ⊢ (A ∈ B → ((F ↾ B) ‘A) = (F ‘A)) | |
| 2 | fvres 3725 | . . . 4 ⊢ (A ∈ B → ((G ↾ B) ‘A) = (G ‘A)) | |
| 3 | 1, 2 | eqeq12d 1486 | . . 3 ⊢ (A ∈ B → (((F ↾ B) ‘A) = ((G ↾ B) ‘A) ↔ (F ‘A) = (G ‘A))) |
| 4 | 3 | biimprd 154 | . 2 ⊢ (A ∈ B → ((F ‘A) = (G ‘A) → ((F ↾ B) ‘A) = ((G ↾ B) ‘A))) |
| 5 | nfvres 3739 | . . . 4 ⊢ (¬ A ∈ B → ((F ↾ B) ‘A) = ∅) | |
| 6 | nfvres 3739 | . . . 4 ⊢ (¬ A ∈ B → ((G ↾ B) ‘A) = ∅) | |
| 7 | 5, 6 | eqtr4d 1507 | . . 3 ⊢ (¬ A ∈ B → ((F ↾ B) ‘A) = ((G ↾ B) ‘A)) |
| 8 | 7 | a1d 12 | . 2 ⊢ (¬ A ∈ B → ((F ‘A) = (G ‘A) → ((F ↾ B) ‘A) = ((G ↾ B) ‘A))) |
| 9 | 4, 8 | pm2.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 954 ∈ wcel 956 ∅c0 2276 ↾ cres 3167 ‘cfv 3177 |
| This theorem is referenced by: fvresex 3848 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-10 964 ax-11 965 ax-12 966 ax-13 967 ax-14 968 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 ax-sep 2698 ax-pow 2737 ax-pr 2774 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 979 df-sb 1170 df-eu 1380 df-mo 1381 df-clab 1462 df-cleq 1467 df-clel 1470 df-ne 1584 df-ral 1646 df-rex 1647 df-v 1808 df-dif 2045 df-un 2046 df-in 2047 df-ss 2049 df-nul 2277 df-pw 2398 df-sn 2408 df-pr 2409 df-op 2412 df-uni 2499 df-br 2615 df-opab 2662 df-xp 3179 df-rel 3180 df-cnv 3181 df-dm 3183 df-rn 3184 df-res 3185 df-ima 3186 df-fv 3193 |