| 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 6621 | . . . 4 ⊢ (𝐹 Fn 𝑆 → (𝐹 ↾ 𝑆) = 𝐹) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → (𝐹 ↾ 𝑆) = 𝐹) |
| 3 | ressnop0 7110 | . . . 4 ⊢ (¬ 𝑋 ∈ 𝑆 → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) | |
| 4 | 3 | adantl 481 | . . 3 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ({〈𝑋, 𝑌〉} ↾ 𝑆) = ∅) |
| 5 | 2, 4 | uneq12d 4123 | . 2 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) = (𝐹 ∪ ∅)) |
| 6 | resundir 5963 | . 2 ⊢ ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = ((𝐹 ↾ 𝑆) ∪ ({〈𝑋, 𝑌〉} ↾ 𝑆)) | |
| 7 | un0 4348 | . . 3 ⊢ (𝐹 ∪ ∅) = 𝐹 | |
| 8 | 7 | eqcomi 2746 | . 2 ⊢ 𝐹 = (𝐹 ∪ ∅) |
| 9 | 5, 6, 8 | 3eqtr4g 2797 | 1 ⊢ ((𝐹 Fn 𝑆 ∧ ¬ 𝑋 ∈ 𝑆) → ((𝐹 ∪ {〈𝑋, 𝑌〉}) ↾ 𝑆) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∪ cun 3901 ∅c0 4287 {csn 4582 〈cop 4588 ↾ cres 5636 Fn wfn 6497 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5245 ax-pr 5381 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5640 df-rel 5641 df-dm 5644 df-res 5646 df-fun 6504 df-fn 6505 |
| This theorem is referenced by: pgpfaclem1 20029 islindf4 21810 evlextv 33725 |
| Copyright terms: Public domain | W3C validator |