| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpodifsnif | 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 | eldifsn 3836 | . . . . 5 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) ↔ (𝑖 ∈ 𝐴 ∧ 𝑖 ≠ 𝑋)) | |
| 2 | neneq 2442 | . . . . 5 ⊢ (𝑖 ≠ 𝑋 → ¬ 𝑖 = 𝑋) | |
| 3 | 1, 2 | simplbiim 391 | . . . 4 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}) → ¬ 𝑖 = 𝑋) |
| 4 | 3 | adantr 276 | . . 3 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → ¬ 𝑖 = 𝑋) |
| 5 | 4 | iffalsed 3647 | . 2 ⊢ ((𝑖 ∈ (𝐴 ∖ {𝑋}) ∧ 𝑗 ∈ 𝐵) → if(𝑖 = 𝑋, 𝐶, 𝐷) = 𝐷) |
| 6 | 5 | mpoeq3ia 6143 | 1 ⊢ (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ if(𝑖 = 𝑋, 𝐶, 𝐷)) = (𝑖 ∈ (𝐴 ∖ {𝑋}), 𝑗 ∈ 𝐵 ↦ 𝐷) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∖ cdif 3217 ifcif 3635 {csn 3705 ∈ cmpo 6077 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-v 2823 df-dif 3222 df-if 3636 df-sn 3711 df-oprab 6079 df-mpo 6080 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |