| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funresdfunsn | Structured version Visualization version GIF version | ||
| Description: Restricting a function to a domain without one element of the domain of the function, and adding a pair of this element and the function value of the element results in the function itself. (Contributed by AV, 2-Dec-2018.) |
| Ref | Expression |
|---|---|
| funresdfunsn | ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funrel 6493 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 2 | resdmdfsn 5975 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
| 4 | 3 | adantr 480 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
| 5 | 4 | uneq1d 4112 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 6 | funfn 6506 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 7 | fnsnsplit 7113 | . . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) | |
| 8 | 6, 7 | sylanb 581 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 9 | 5, 8 | eqtr4d 2769 | 1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 Vcvv 3436 ∖ cdif 3894 ∪ cun 3895 {csn 4571 〈cop 4577 dom cdm 5611 ↾ cres 5613 Rel wrel 5616 Fun wfun 6470 Fn wfn 6471 ‘cfv 6476 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-12 2180 ax-ext 2703 ax-sep 5229 ax-nul 5239 ax-pr 5365 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-br 5087 df-opab 5149 df-id 5506 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 |
| This theorem is referenced by: setsidvald 17105 |
| Copyright terms: Public domain | W3C validator |