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 6353 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
2 | resdmdfsn 5874 | . . . . 5 ⊢ (Rel 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (Fun 𝐹 → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
4 | 3 | adantr 485 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))) |
5 | 4 | uneq1d 4068 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
6 | funfn 6366 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
7 | fnsnsplit 6938 | . . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) | |
8 | 6, 7 | sylanb 585 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
9 | 5, 8 | eqtr4d 2797 | 1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 400 = wceq 1539 ∈ wcel 2112 Vcvv 3410 ∖ cdif 3856 ∪ cun 3857 {csn 4523 〈cop 4529 dom cdm 5525 ↾ cres 5527 Rel wrel 5530 Fun wfun 6330 Fn wfn 6331 ‘cfv 6336 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5170 ax-nul 5177 ax-pr 5299 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2902 df-ral 3076 df-rex 3077 df-reu 3078 df-rab 3080 df-v 3412 df-sbc 3698 df-dif 3862 df-un 3864 df-in 3866 df-ss 3876 df-nul 4227 df-if 4422 df-sn 4524 df-pr 4526 df-op 4530 df-uni 4800 df-br 5034 df-opab 5096 df-id 5431 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 |
This theorem is referenced by: setsidvald 16573 |
Copyright terms: Public domain | W3C validator |