![]() |
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 6564 | . . . . 5 ⊢ (Fun 𝐹 → Rel 𝐹) | |
2 | resdmdfsn 6029 | . . . . 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 4158 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩})) |
6 | funfn 6577 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
7 | fnsnsplit 7187 | . . 3 ⊢ ((𝐹 Fn dom 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩})) | |
8 | 6, 7 | sylanb 580 | . 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → 𝐹 = ((𝐹 ↾ (dom 𝐹 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩})) |
9 | 5, 8 | eqtr4d 2770 | 1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 Vcvv 3469 ∖ cdif 3941 ∪ cun 3942 {csn 4624 ⟨cop 4630 dom cdm 5672 ↾ cres 5674 Rel wrel 5677 Fun wfun 6536 Fn wfn 6537 ‘cfv 6542 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-12 2164 ax-ext 2698 ax-sep 5293 ax-nul 5300 ax-pr 5423 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-ne 2936 df-ral 3057 df-rex 3066 df-reu 3372 df-rab 3428 df-v 3471 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4525 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5143 df-opab 5205 df-id 5570 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 |
This theorem is referenced by: setsidvald 17153 setsidvaldOLD 17154 |
Copyright terms: Public domain | W3C validator |