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

Theorem fnsnsplitdc 6649
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 5431 . . 3 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
213ad2ant2 1043 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = 𝐹)
3 resundi 5017 . . 3 (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋}))
4 dcdifsnid 6648 . . . . 5 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
543adant2 1040 . . . 4 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
65reseq2d 5004 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = (𝐹𝐴))
7 fnressn 5824 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ {𝑋}) = {⟨𝑋, (𝐹𝑋)⟩})
87uneq2d 3358 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
983adant1 1039 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
103, 6, 93eqtr3a 2286 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
112, 10eqtr3d 2264 1 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → 𝐹 = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 839  w3a 1002   = wceq 1395  wcel 2200  wral 2508  cdif 3194  cun 3195  {csn 3666  cop 3669  cres 4720   Fn wfn 5312  cfv 5317
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 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325
This theorem is referenced by:  funresdfunsndc  6650
  Copyright terms: Public domain W3C validator