| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifmpt2v | Structured version Visualization version GIF version | ||
| Description: Move a conditional inside and outside a function in maps-to notation. (Contributed by SN, 16-Oct-2025.) |
| Ref | Expression |
|---|---|
| ifmpt2v | ⊢ (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iftrue 4480 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐵, 𝐶) = 𝐵) | |
| 2 | 1 | mpteq2dv 5188 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 3 | iftrue 4480 | . . 3 ⊢ (𝜑 → if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 4 | 2, 3 | eqtr4d 2794 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶))) |
| 5 | iffalse 4483 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐵, 𝐶) = 𝐶) | |
| 6 | 5 | mpteq2dv 5188 | . . 3 ⊢ (¬ 𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| 7 | iffalse 4483 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 8 | 6, 7 | eqtr4d 2794 | . 2 ⊢ (¬ 𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶))) |
| 9 | 4, 8 | pm2.61i 183 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1554 ifcif 4474 ↦ cmpt 5175 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-ext 2728 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-ex 1794 df-sb 2085 df-clab 2735 df-cleq 2748 df-clel 2831 df-if 4475 df-opab 5157 df-mpt 5176 |
| This theorem is referenced by: psdmvr 22207 |
| Copyright terms: Public domain | W3C validator |