MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsnunres Structured version   Visualization version   GIF version

Theorem fsnunres 7186
Description: Recover the original function from a point-added function. (Contributed by Stefan O'Rear, 28-Feb-2015.)
Assertion
Ref Expression
fsnunres ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) ↾ 𝑆) = 𝐹)

Proof of Theorem fsnunres
StepHypRef Expression
1 fnresdm 6654 . . . 4 (𝐹 Fn 𝑆 → (𝐹𝑆) = 𝐹)
21adantr 485 . . 3 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → (𝐹𝑆) = 𝐹)
3 ressnop0 7150 . . . 4 𝑋𝑆 → ({⟨𝑋, 𝑌⟩} ↾ 𝑆) = ∅)
43adantl 486 . . 3 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ({⟨𝑋, 𝑌⟩} ↾ 𝑆) = ∅)
52, 4uneq12d 4122 . 2 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ((𝐹𝑆) ∪ ({⟨𝑋, 𝑌⟩} ↾ 𝑆)) = (𝐹 ∪ ∅))
6 resundir 5992 . 2 ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) ↾ 𝑆) = ((𝐹𝑆) ∪ ({⟨𝑋, 𝑌⟩} ↾ 𝑆))
7 un0 4350 . . 3 (𝐹 ∪ ∅) = 𝐹
87eqcomi 2771 . 2 𝐹 = (𝐹 ∪ ∅)
95, 6, 83eqtr4g 2822 1 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) ↾ 𝑆) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 400   = wceq 1569  wcel 2142  cun 3902  c0 4285  {csn 4588  cop 4594  cres 5662   Fn wfn 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-xp 5666  df-rel 5667  df-dm 5670  df-res 5672  df-fun 6538  df-fn 6539
This theorem is used by:  pgpfaclem1  20159  islindf4  21999  evlextv  33941
  Copyright terms: Public domain W3C validator