| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpodifsnif | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| mpodifsnif | ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsnneq 4753 | . . . 4 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) → ¬ 𝑖 = 𝑋) | |
| 2 | 1 | adantr 484 | . . 3 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → ¬ 𝑖 = 𝑋) |
| 3 | 2 | iffalsed 4493 | . 2 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → if(𝑖 = 𝑋, 𝐶, 𝐷) = 𝐷) |
| 4 | 3 | mpoeq3ia 7476 | 1 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ∖ cdif 3903 ifcif 4482 {csn 4584 ∈ cmpo 7400 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-v 3458 df-dif 3909 df-if 4483 df-sn 4585 df-oprab 7402 df-mpo 7403 |
| This theorem is referenced by: smadiadetglem1 22733 |
| Copyright terms: Public domain | W3C validator |