MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  partfun Structured version   Visualization version   GIF version

Theorem partfun 6696
Description: Rewrite a function defined by parts, using a mapping and an if construct, into a union of functions on disjoint domains. (Contributed by Thierry Arnoux, 30-Mar-2017.)
Assertion
Ref Expression
partfun (𝑥𝐴 ↦ if(𝑥𝐵, 𝐶, 𝐷)) = ((𝑥 ∈ (𝐴𝐵) ↦ 𝐶) ∪ (𝑥 ∈ (𝐴𝐵) ↦ 𝐷))

Proof of Theorem partfun
StepHypRef Expression
1 mptun 6695 . 2 (𝑥 ∈ ((𝐴𝐵) ∪ (𝐴𝐵)) ↦ if(𝑥𝐵, 𝐶, 𝐷)) = ((𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷)) ∪ (𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷)))
2 inundif 4474 . . 3 ((𝐴𝐵) ∪ (𝐴𝐵)) = 𝐴
3 eqid 2727 . . 3 if(𝑥𝐵, 𝐶, 𝐷) = if(𝑥𝐵, 𝐶, 𝐷)
42, 3mpteq12i 5248 . 2 (𝑥 ∈ ((𝐴𝐵) ∪ (𝐴𝐵)) ↦ if(𝑥𝐵, 𝐶, 𝐷)) = (𝑥𝐴 ↦ if(𝑥𝐵, 𝐶, 𝐷))
5 elinel2 4192 . . . . 5 (𝑥 ∈ (𝐴𝐵) → 𝑥𝐵)
65iftrued 4532 . . . 4 (𝑥 ∈ (𝐴𝐵) → if(𝑥𝐵, 𝐶, 𝐷) = 𝐶)
76mpteq2ia 5245 . . 3 (𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐶)
8 eldifn 4123 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ¬ 𝑥𝐵)
98iffalsed 4535 . . . 4 (𝑥 ∈ (𝐴𝐵) → if(𝑥𝐵, 𝐶, 𝐷) = 𝐷)
109mpteq2ia 5245 . . 3 (𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷)) = (𝑥 ∈ (𝐴𝐵) ↦ 𝐷)
117, 10uneq12i 4157 . 2 ((𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷)) ∪ (𝑥 ∈ (𝐴𝐵) ↦ if(𝑥𝐵, 𝐶, 𝐷))) = ((𝑥 ∈ (𝐴𝐵) ↦ 𝐶) ∪ (𝑥 ∈ (𝐴𝐵) ↦ 𝐷))
121, 4, 113eqtr3i 2763 1 (𝑥𝐴 ↦ if(𝑥𝐵, 𝐶, 𝐷)) = ((𝑥 ∈ (𝐴𝐵) ↦ 𝐶) ∪ (𝑥 ∈ (𝐴𝐵) ↦ 𝐷))
Colors of variables: wff setvar class
Syntax hints:   = wceq 1534  wcel 2099  cdif 3941  cun 3942  cin 3943  ifcif 4524  cmpt 5225
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2698
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-if 4525  df-opab 5205  df-mpt 5226
This theorem is referenced by:  mptiffisupp  32444  mptprop  32449  cycpm2tr  32805  fsuppssindlem2  41737
  Copyright terms: Public domain W3C validator