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 33212
Description: Recover the original function from a point-added function. See also funresdfunsn 7192 and fsnunres 7191. (Contributed by Thierry Arnoux, 15-Feb-2026.)
Assertion
Ref Expression
fresunsn ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = 𝐹)

Proof of Theorem fresunsn
StepHypRef Expression
1 resdmdfsn 6021 . . . 4 (𝐹 ↾ (V ∖ {𝑋})) = (𝐹 ↾ (dom 𝐹 ∖ {𝑋}))
2 fndm 6640 . . . . . . 7 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
323ad2ant1 1151 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → dom 𝐹 = 𝐴)
43difeq1d 4073 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (dom 𝐹 ∖ {𝑋}) = (𝐴 ∖ {𝑋}))
54reseq2d 5970 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (dom 𝐹 ∖ {𝑋})) = (𝐹 ↾ (𝐴 ∖ {𝑋})))
61, 5eqtr2id 2809 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹 ↾ (𝐴 ∖ {𝑋})) = (𝐹 ↾ (V ∖ {𝑋})))
7 simp3 1156 . . . . . 6 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → (𝐹‘𝑋) = 𝑌)
87eqcomd 2767 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑌 = (𝐹‘𝑋))
98opeq2d 4840 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ⟨𝑋, 𝑌⟩ = ⟨𝑋, (𝐹‘𝑋)⟩)
109sneqd 4596 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → {⟨𝑋, 𝑌⟩} = {⟨𝑋, (𝐹‘𝑋)⟩})
116, 10uneq12d 4116 . 2 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}))
12 fnfun 6637 . . . 4 (𝐹 Fn 𝐴 → Fun 𝐹)
13123ad2ant1 1151 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → Fun 𝐹)
142eleq2d 2847 . . . . 5 (𝐹 Fn 𝐴 → (𝑋 ∈ dom 𝐹 ↔ 𝑋 ∈ 𝐴))
1514biimpar 483 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ dom 𝐹)
16153adant3 1150 . . 3 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → 𝑋 ∈ dom 𝐹)
17 funresdfunsn 7192 . . 3 ((Fun 𝐹 ∧ 𝑋 ∈ dom 𝐹) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = 𝐹)
1813, 16, 17syl2anc 596 . 2 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (V ∖ {𝑋})) ∪ {⟨𝑋, (𝐹‘𝑋)⟩}) = 𝐹)
1911, 18eqtrd 2796 1 ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) = 𝑌) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896   ∪ cun 3897  {csn 4584  ⟨cop 4590  dom cdm 5651   ↾ cres 5653  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545
This theorem is used by:  evlextv  34167
  Copyright terms: Public domain W3C validator