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

Theorem mpodifsnif 7535
Description: A mapping with two arguments with the first argument from a difference set with a singleton and a conditional as result. (Contributed by AV, 13-Feb-2019.)
Assertion
Ref Expression
mpodifsnif (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷)

Proof of Theorem mpodifsnif
StepHypRef Expression
1 eldifsnneq 4753 . . . 4 (𝑖 ∈ (𝐴 ∖ {𝑋}) → ¬ 𝑖 = 𝑋)
21adantr 486 . . 3 ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → ¬ 𝑖 = 𝑋)
32iffalsed 4492 . 2 ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → if(𝑖 = 𝑋, 𝐶, 𝐷) = 𝐷)
43mpoeq3ia 7498 1 (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ∖ cdif 4045  ifcif 4481  {csn 4583   ∈ cmpo 7422
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-v 3452  df-dif 4047  df-if 4482  df-sn 4584  df-oprab 7424  df-mpo 7425
This theorem is used by:  smadiadetglem1  22986
  Copyright terms: Public domain W3C validator