Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fdmdifeqresdif Structured version   Visualization version   GIF version

Theorem fdmdifeqresdif 41913
 Description: The restriction of a conditional mapping to function values of a function having a domain which is a difference with a singleton equals this function. (Contributed by AV, 23-Apr-2019.)
Hypothesis
Ref Expression
fdmdifeqresdif.f 𝐹 = (𝑥𝐷 ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥)))
Assertion
Ref Expression
fdmdifeqresdif (𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝐺 = (𝐹 ↾ (𝐷 ∖ {𝑌})))
Distinct variable groups:   𝑥,𝐷   𝑥,𝐺   𝑥,𝑅   𝑥,𝑌
Allowed substitution hints:   𝐹(𝑥)   𝑋(𝑥)

Proof of Theorem fdmdifeqresdif
StepHypRef Expression
1 eldifsn 4260 . . . . . 6 (𝑥 ∈ (𝐷 ∖ {𝑌}) ↔ (𝑥𝐷𝑥𝑌))
2 df-ne 2782 . . . . . . . 8 (𝑥𝑌 ↔ ¬ 𝑥 = 𝑌)
32biimpi 205 . . . . . . 7 (𝑥𝑌 → ¬ 𝑥 = 𝑌)
43adantl 481 . . . . . 6 ((𝑥𝐷𝑥𝑌) → ¬ 𝑥 = 𝑌)
51, 4sylbi 206 . . . . 5 (𝑥 ∈ (𝐷 ∖ {𝑌}) → ¬ 𝑥 = 𝑌)
65adantl 481 . . . 4 ((𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝑥 ∈ (𝐷 ∖ {𝑌})) → ¬ 𝑥 = 𝑌)
76iffalsed 4047 . . 3 ((𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝑥 ∈ (𝐷 ∖ {𝑌})) → if(𝑥 = 𝑌, 𝑋, (𝐺𝑥)) = (𝐺𝑥))
87mpteq2dva 4672 . 2 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅 → (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥))) = (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ (𝐺𝑥)))
9 fdmdifeqresdif.f . . . 4 𝐹 = (𝑥𝐷 ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥)))
109reseq1i 5313 . . 3 (𝐹 ↾ (𝐷 ∖ {𝑌})) = ((𝑥𝐷 ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥))) ↾ (𝐷 ∖ {𝑌}))
11 difssd 3700 . . . 4 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅 → (𝐷 ∖ {𝑌}) ⊆ 𝐷)
1211resmptd 5371 . . 3 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅 → ((𝑥𝐷 ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥))) ↾ (𝐷 ∖ {𝑌})) = (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥))))
1310, 12syl5eq 2656 . 2 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅 → (𝐹 ↾ (𝐷 ∖ {𝑌})) = (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ if(𝑥 = 𝑌, 𝑋, (𝐺𝑥))))
14 ffn 5958 . . 3 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝐺 Fn (𝐷 ∖ {𝑌}))
15 dffn5 6151 . . 3 (𝐺 Fn (𝐷 ∖ {𝑌}) ↔ 𝐺 = (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ (𝐺𝑥)))
1614, 15sylib 207 . 2 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝐺 = (𝑥 ∈ (𝐷 ∖ {𝑌}) ↦ (𝐺𝑥)))
178, 13, 163eqtr4rd 2655 1 (𝐺:(𝐷 ∖ {𝑌})⟶𝑅𝐺 = (𝐹 ↾ (𝐷 ∖ {𝑌})))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780   ∖ cdif 3537  ifcif 4036  {csn 4125   ↦ cmpt 4643   ↾ cres 5040   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812 This theorem is referenced by:  lincext2  42038  lincext3  42039
 Copyright terms: Public domain W3C validator