Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fmptunsnop Structured version   Visualization version   GIF version

Theorem fmptunsnop 33392
Description: Two ways to express a function with a value replaced. (Contributed by Thierry Arnoux, 5-Oct-2025.)
Hypotheses
Ref Expression
fmptunsnop.1 (𝜑 → 𝐹 Fn 𝐴)
fmptunsnop.2 (𝜑 → 𝑋 ∈ 𝐴)
fmptunsnop.3 (𝜑 → 𝑌 ∈ 𝐵)
Assertion
Ref Expression
fmptunsnop (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑋   𝑥,𝑌   𝜑,𝑥
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem fmptunsnop
StepHypRef Expression
1 mptun 6714 . 2 (𝑥 ∈ ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = ((𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) ∪ (𝑥 ∈ {𝑋} ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))))
2 fmptunsnop.2 . . . 4 (𝜑 → 𝑋 ∈ 𝐴)
3 difsnid 4772 . . . 4 (𝑋 ∈ 𝐴 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
42, 3syl 18 . . 3 (𝜑 → ((𝐴 ∖ {𝑋}) ∪ {𝑋}) = 𝐴)
54mpteq1d 5200 . 2 (𝜑 → (𝑥 ∈ ((𝐴 ∖ {𝑋}) ∪ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = (𝑥 ∈ 𝐴 ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))))
6 eldifsni 4754 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ {𝑋}) → 𝑥 ≠ 𝑋)
76adantl 487 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑋})) → 𝑥 ≠ 𝑋)
87neneqd 2967 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑋})) → ¬ 𝑥 = 𝑋)
98iffalsed 4495 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ {𝑋})) → if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥)) = (𝐹‘𝑥))
109mpteq2dva 5203 . . . 4 (𝜑 → (𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = (𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ (𝐹‘𝑥)))
11 fmptunsnop.1 . . . . . 6 (𝜑 → 𝐹 Fn 𝐴)
12 dffn3 6751 . . . . . 6 (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹)
1311, 12sylib 221 . . . . 5 (𝜑 → 𝐹:𝐴⟶ran 𝐹)
14 difssd 4075 . . . . 5 (𝜑 → (𝐴 ∖ {𝑋}) ⊆ 𝐴)
1513, 14feqresmpt 6984 . . . 4 (𝜑 → (𝐹 ↾ (𝐴 ∖ {𝑋})) = (𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ (𝐹‘𝑥)))
1610, 15eqtr4d 2804 . . 3 (𝜑 → (𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = (𝐹 ↾ (𝐴 ∖ {𝑋})))
17 iftrue 4490 . . . . . 6 (𝑥 = 𝑋 → if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥)) = 𝑌)
1817adantl 487 . . . . 5 ((𝜑 ∧ 𝑥 = 𝑋) → if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥)) = 𝑌)
19 fmptunsnop.3 . . . . 5 (𝜑 → 𝑌 ∈ 𝐵)
2018, 2, 19fmptsnd 7204 . . . 4 (𝜑 → {⟨𝑋, 𝑌⟩} = (𝑥 ∈ {𝑋} ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))))
2120eqcomd 2772 . . 3 (𝜑 → (𝑥 ∈ {𝑋} ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = {⟨𝑋, 𝑌⟩})
2216, 21uneq12d 4170 . 2 (𝜑 → ((𝑥 ∈ (𝐴 ∖ {𝑋}) ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) ∪ (𝑥 ∈ {𝑋} ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥)))) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}))
231, 5, 223eqtr3a 2825 1 (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 = 𝑋, 𝑌, (𝐹‘𝑥))) = ((𝐹 ↾ (𝐴 ∖ {𝑋})) ∪ {⟨𝑋, 𝑌⟩}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962   ∖ cdif 4047   ∪ cun 4151  ifcif 4484  {csn 4587  ⟨cop 4839   ↦ cmpt 5191  ran crn 5658   ↾ cres 5659   Fn wfn 6560  ⟶wf 6561  ‘cfv 6565
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-fv 6573
This theorem is used by:  elrgspnlem4  33906
  Copyright terms: Public domain W3C validator