| 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 6637 | . . . 4 ⊢ (𝐹 Fn 𝑆 → (𝐹 ↾ 𝑆) = 𝐹) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → (𝐹 ↾ 𝑆) = 𝐹) |
| 3 | ressnop0 7125 | . . . 4 ⊢ (¬ 𝑋 ∈ 𝑆 → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) | |
| 4 | 3 | adantl 481 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) |
| 5 | 2, 4 | uneq12d 4132 | . 2 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) = (𝐹 ∪ ∅)) |
| 6 | resundir 5965 | . 2 ⊢ ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) | |
| 7 | un0 4357 | . . 3 ⊢ (𝐹 ∪ ∅) = 𝐹 | |
| 8 | 7 | eqcomi 2738 | . 2 ⊢ 𝐹 = (𝐹 ∪ ∅) |
| 9 | 5, 6, 8 | 3eqtr4g 2789 | 1 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∪ cun 3912 ∅c0 4296 {csn 4589 〈cop 4595 ↾ cres 5640 Fn wfn 6506 |
| 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-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| 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-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-xp 5644 df-rel 5645 df-dm 5648 df-res 5650 df-fun 6513 df-fn 6514 |
| This theorem is referenced by: pgpfaclem1 20013 islindf4 21747 |
| Copyright terms: Public domain | W3C validator |