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

Theorem fnsnsplitdc 6778
Description: Split a function into a single point and all the rest. (Contributed by Stefan O'Rear, 27-Feb-2015.) (Revised by Jim Kingdon, 29-Jan-2023.)
Assertion
Ref Expression
fnsnsplitdc ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → 𝐹 = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝐹(𝑥, 𝑦)

Proof of Theorem fnsnsplitdc
StepHypRef Expression
1 fnresdm 5492 . . 3 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
213ad2ant2 1050 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = 𝐹)
3 resundi 5076 . . 3 (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋}))
4 dcdifsnid 6777 . . . . 5 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
543adant2 1047 . . . 4 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
65reseq2d 5063 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = (𝐹𝐴))
7 fnressn 5901 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ {𝑋}) = {⟨𝑋, (𝐹𝑋)⟩})
87uneq2d 3383 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
983adant1 1046 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
103, 6, 93eqtr3a 2295 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
112, 10eqtr3d 2273 1 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → 𝐹 = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  DECID wdc 846  w3a 1009   = wceq 1402  wcel 2209  wral 2528  cdif 3217  cun 3218  {csn 3709  cop 3712  cres 4776   Fn wfn 5372  cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385
This theorem is used by:  funresdfunsndc  6779
  Copyright terms: Public domain W3C validator