Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mpt2difsnif | 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 |
---|---|
mpt2difsnif | ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eldifsn 4317 | . . . . 5 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) ↔ (𝑖 ∈ 𝐴 ∧ 𝑖 ≠ 𝑋)) | |
2 | neneq 2800 | . . . . 5 ⊢ (𝑖 ≠ 𝑋 → ¬ 𝑖 = 𝑋) | |
3 | 1, 2 | simplbiim 659 | . . . 4 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) → ¬ 𝑖 = 𝑋) |
4 | 3 | adantr 481 | . . 3 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → ¬ 𝑖 = 𝑋) |
5 | 4 | iffalsed 4097 | . 2 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → if(𝑖 = 𝑋, 𝐶, 𝐷) = 𝐷) |
6 | 5 | mpt2eq3ia 6720 | 1 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∖ cdif 3571 ifcif 4086 {csn 4177 ↦ cmpt2 6652 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-v 3202 df-dif 3577 df-if 4087 df-sn 4178 df-oprab 6654 df-mpt2 6655 |
This theorem is referenced by: smadiadetglem1 20477 |
Copyright terms: Public domain | W3C validator |