Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fresunsn Structured version   Visualization version   GIF version

Theorem fresunsn 33317
Description: Recover the original function from a point-added function. See also funresdfunsn 7225 and fsnunres 7224. (Contributed by Thierry Arnoux, 15-Feb-2026.)
Assertion
Ref Expression
fresunsn ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = 𝐹)

Proof of Theorem fresunsn
StepHypRef Expression
1 resdmdfsn 6039 . . . 4 (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))
2 fndm 6672 . . . . . . 7 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
323ad2ant1 1151 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → dom 𝐹 = 𝐴)
43difeq1d 4065 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (dom 𝐹 ∖ {𝑋}) = (𝐴 ∖ {𝑋}))
54reseq2d 5986 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (dom 𝐹 ∖ {𝑋})) = (𝐹 ↾ (𝐴 ∖ {𝑋})))
61, 5eqtr2id 2811 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (𝐴 ∖ {𝑋})) = (𝐹 ↾ (V ∖ {𝑋})))
7 simp3 1156 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹‘𝑋) = 𝑌)
87eqcomd 2769 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑌 = (𝐹‘𝑋))
98opeq2d 4852 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ⟨𝑋, 𝑌⟩ = ⟨𝑋, (𝐹‘𝑋)⟩)
109sneqd 4596 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → {⟨𝑋, 𝑌⟩} = {⟨𝑋, (𝐹‘𝑋)⟩})
116, 10uneq12d 4171 . 2 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}))
12 fnfun 6669 . . . 4 (𝐹 Fn 𝐴 → Fun 𝐹)
13123ad2ant1 1151 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → Fun 𝐹)
142eleq2d 2850 . . . . 5 (𝐹 Fn 𝐴 → (𝑋 ∈ dom 𝐹 ↔ 𝑋 ∈ 𝐴))
1514biimpar 483 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ dom 𝐹)
16153adant3 1150 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑋 ∈ dom 𝐹)
17 funresdfunsn 7225 . . 3 ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = 𝐹)
1813, 16, 17syl2anc 596 . 2 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = 𝐹)
1911, 18eqtrd 2798 1 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048   ∪ cun 4152  {csn 4588  ⟨cop 4840  dom cdm 5658   ↾ cres 5660  Fun wfun 6560   Fn wfn 6561  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by:  evlextv  34285
  Copyright terms: Public domain W3C validator