| 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 6535 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
| 2 | resdmdfsn 6004 | . . . . 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 4132 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 6 | funfn 6548 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 7 | fnsnsplit 7160 | . . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) | |
| 8 | 6, 7 | sylanb 581 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 9 | 5, 8 | eqtr4d 2768 | 1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3450 ∖ cdif 3913 ∪ cun 3914 {csn 4591 〈cop 4597 dom cdm 5640 ↾ cres 5642 Rel wrel 5645 Fun wfun 6507 Fn wfn 6508 ‘cfv 6513 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2702 ax-sep 5253 ax-nul 5263 ax-pr 5389 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-nul 4299 df-if 4491 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5110 df-opab 5172 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 |
| This theorem is referenced by: setsidvald 17175 |
| Copyright terms: Public domain | W3C validator |