| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fveqres | Structured version Visualization version GIF version | ||
| Description: Equal values imply equal values in a restriction. (Contributed by NM, 13-Nov-1995.) |
| Ref | Expression |
|---|---|
| fveqres | ⊢ ((𝐹‘𝐴) = (𝐺‘𝐴) → ((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvres 6887 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = (𝐹‘𝐴)) | |
| 2 | fvres 6887 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → ((𝐺 ↾ 𝐵)‘𝐴) = (𝐺‘𝐴)) | |
| 3 | 1, 2 | eqeq12d 2779 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴) ↔ (𝐹‘𝐴) = (𝐺‘𝐴))) |
| 4 | 3 | biimprd 250 | . 2 ⊢ (𝐴 ∈ 𝐵 → ((𝐹‘𝐴) = (𝐺‘𝐴) → ((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴))) |
| 5 | nfvres 6906 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = ∅) | |
| 6 | nfvres 6906 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐺 ↾ 𝐵)‘𝐴) = ∅) | |
| 7 | 5, 6 | eqtr4d 2801 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴)) |
| 8 | 7 | a1d 25 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐹‘𝐴) = (𝐺‘𝐴) → ((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴))) |
| 9 | 4, 8 | pm2.61i 183 | 1 ⊢ ((𝐹‘𝐴) = (𝐺‘𝐴) → ((𝐹 ↾ 𝐵)‘𝐴) = ((𝐺 ↾ 𝐵)‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1561 ∈ wcel 2143 ∅c0 4286 ↾ cres 5650 ‘cfv 6522 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pr 5391 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5102 df-opab 5164 df-xp 5654 df-dm 5658 df-res 5660 df-iota 6478 df-fv 6530 |
| This theorem is referenced by: fvresex 7942 |
| Copyright terms: Public domain | W3C validator |