Theorem mpodifsnif 7555

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

Step	Hyp	Ref	Expression
1		eldifsnneq 4754	. . . 4 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) → ¬ 𝑖 = 𝑋)
2	1	adantr 486	. . 3 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → ¬ 𝑖 = 𝑋)
3	2	iffalsed 4496	. 2 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → if(𝑖 = 𝑋, 𝐶, 𝐷) = 𝐷)
4	3	mpoeq3ia 7518	1 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ∖ cdif 4048  ifcif 4485  {csn 4588   ∈ cmpo 7442

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-v 3456  df-dif 4050  df-if 4486  df-sn 4589  df-oprab 7444  df-mpo 7445

This theorem is used by:  smadiadetglem1  23013