| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsnunres | Structured version Visualization version GIF version | ||
| Description: Recover the original function from a point-added function. (Contributed by Stefan O'Rear, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| fsnunres | ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnresdm 6608 | . . . 4 ⊢ (𝐹 Fn 𝑆 → (𝐹 ↾ 𝑆) = 𝐹) | |
| 2 | 1 | adantr 482 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → (𝐹 ↾ 𝑆) = 𝐹) |
| 3 | ressnop0 7100 | . . . 4 ⊢ (¬ 𝑋 ∈ 𝑆 → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) | |
| 4 | 3 | adantl 483 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) |
| 5 | 2, 4 | uneq12d 4102 | . 2 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) = (𝐹 ∪ ∅)) |
| 6 | resundir 5953 | . 2 ⊢ ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) | |
| 7 | un0 4325 | . . 3 ⊢ (𝐹 ∪ ∅) = 𝐹 | |
| 8 | 7 | eqcomi 2750 | . 2 ⊢ 𝐹 = (𝐹 ∪ ∅) |
| 9 | 5, 6, 8 | 3eqtr4g 2801 | 1 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∪ cun 3883 ∅c0 4264 {csn 4558 〈cop 4564 ↾ cres 5623 Fn wfn 6484 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-br 5076 df-opab 5138 df-xp 5627 df-rel 5628 df-dm 5631 df-res 5633 df-fun 6491 df-fn 6492 |
| This theorem is referenced by: pgpfaclem1 20053 islindf4 21817 evlextv 33738 |
| Copyright terms: Public domain | W3C validator |