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

Theorem fnsnsplitdc 6738
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 5467 . . 3 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
213ad2ant2 1046 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = 𝐹)
3 resundi 5051 . . 3 (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋}))
4 dcdifsnid 6737 . . . . 5 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
543adant2 1043 . . . 4 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
65reseq2d 5038 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ ((𝐴 ∖ {𝑋}) ∪ {𝑋})) = (𝐹𝐴))
7 fnressn 5870 . . . . 5 ((𝐹 Fn 𝐴𝑋𝐴) → (𝐹 ↾ {𝑋}) = {⟨𝑋, (𝐹𝑋)⟩})
87uneq2d 3373 . . . 4 ((𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
983adant1 1042 . . 3 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ (𝐹 ↾ {𝑋})) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
103, 6, 93eqtr3a 2289 . 2 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → (𝐹𝐴) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
112, 10eqtr3d 2267 1 ((∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦𝐹 Fn 𝐴𝑋𝐴) → 𝐹 = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, (𝐹𝑋)⟩}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 842  w3a 1005   = wceq 1398  wcel 2203  wral 2520  cdif 3208  cun 3209  {csn 3689  cop 3692  cres 4751   Fn wfn 5347  cfv 5352
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360
This theorem is referenced by:  funresdfunsndc  6739
  Copyright terms: Public domain W3C validator