ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fsnunres GIF version

Theorem fsnunres 5841
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 5432 . . . 4 (𝐹 Fn 𝑆 → (𝐹𝑆) = 𝐹)
21adantr 276 . . 3 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → (𝐹𝑆) = 𝐹)
3 ressnop0 5820 . . . 4 𝑋𝑆 → ({⟨𝑋, 𝑌⟩} ↾ 𝑆) = ∅)
43adantl 277 . . 3 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ({⟨𝑋, 𝑌⟩} ↾ 𝑆) = ∅)
52, 4uneq12d 3359 . 2 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ((𝐹𝑆) ∪ ({⟨𝑋, 𝑌⟩} ↾ 𝑆)) = (𝐹 ∪ ∅))
6 resundir 5019 . 2 ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) ↾ 𝑆) = ((𝐹𝑆) ∪ ({⟨𝑋, 𝑌⟩} ↾ 𝑆))
7 un0 3525 . . 3 (𝐹 ∪ ∅) = 𝐹
87eqcomi 2233 . 2 𝐹 = (𝐹 ∪ ∅)
95, 6, 83eqtr4g 2287 1 ((𝐹 Fn 𝑆 ∧ ¬ 𝑋𝑆) → ((𝐹 ∪ {⟨𝑋, 𝑌⟩}) ↾ 𝑆) = 𝐹)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1395  wcel 2200  cun 3195  c0 3491  {csn 3666  cop 3669  cres 4721   Fn wfn 5313
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-dm 4729  df-res 4731  df-fun 5320  df-fn 5321
This theorem is referenced by:  tfrlemisucaccv  6471  tfr1onlemsucaccv  6487  tfrcllemsucaccv  6500
  Copyright terms: Public domain W3C validator