| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fresunsn | Structured version Visualization version GIF version | ||
| Description: Recover the original function from a point-added function. See also funresdfunsn 7187 and fsnunres 7186. (Contributed by Thierry Arnoux, 15-Feb-2026.) |
| Ref | Expression |
|---|---|
| fresunsn | ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉}) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resdmdfsn 6025 | . . . 4 ⊢ (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋})) | |
| 2 | fndm 6635 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 3 | 2 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → dom 𝐹 = 𝐴) |
| 4 | 3 | difeq1d 4073 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (dom 𝐹 ∖ {𝑋}) = (𝐴 ∖ {𝑋})) |
| 5 | 4 | reseq2d 5972 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (dom 𝐹 ∖ {𝑋})) = (𝐹 ↾ (𝐴 ∖ {𝑋}))) |
| 6 | 1, 5 | eqtr2id 2808 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (𝐴 ∖ {𝑋})) = (𝐹 ↾ (V ∖ {𝑋}))) |
| 7 | simp3 1156 | . . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹‘𝑋) = 𝑌) | |
| 8 | 7 | eqcomd 2766 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑌 = (𝐹‘𝑋)) |
| 9 | 8 | opeq2d 4840 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 〈𝑋, 𝑌〉 = 〈𝑋, (𝐹‘𝑋)〉) |
| 10 | 9 | sneqd 4596 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → {〈𝑋, 𝑌〉} = {〈𝑋, (𝐹‘𝑋)〉}) |
| 11 | 6, 10 | uneq12d 4116 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉}) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉})) |
| 12 | fnfun 6632 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 13 | 12 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → Fun 𝐹) |
| 14 | 2 | eleq2d 2846 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝑋 ∈ dom 𝐹 ↔ 𝑋 ∈ 𝐴)) |
| 15 | 14 | biimpar 483 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ dom 𝐹) |
| 16 | 15 | 3adant3 1150 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑋 ∈ dom 𝐹) |
| 17 | funresdfunsn 7187 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) | |
| 18 | 13, 16, 17 | syl2anc 596 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {〈𝑋, (𝐹‘𝑋)〉}) = 𝐹) |
| 19 | 11, 18 | eqtrd 2795 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {〈𝑋, 𝑌〉}) = 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∖ cdif 3896 ∪ cun 3897 {csn 4584 〈cop 4590 dom cdm 5655 ↾ cres 5657 Fun wfun 6527 Fn wfn 6528 ‘cfv 6533 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 |
| This theorem is used by: evlextv 34052 |
| Copyright terms: Public domain | W3C validator |