| 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 4492 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐵, 𝐶) = 𝐵) | |
| 2 | 1 | mpteq2dv 5204 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 3 | iftrue 4492 | . . 3 ⊢ (𝜑 → if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 4 | 2, 3 | eqtr4d 2800 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶))) |
| 5 | iffalse 4495 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐵, 𝐶) = 𝐶) | |
| 6 | 5 | mpteq2dv 5204 | . . 3 ⊢ (¬ 𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| 7 | iffalse 4495 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 8 | 6, 7 | eqtr4d 2800 | . 2 ⊢ (¬ 𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶))) |
| 9 | 4, 8 | pm2.61i 184 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝜑, 𝐵, 𝐶)) = if(𝜑, (𝑥 ∈ 𝐴 ↦ 𝐵), (𝑥 ∈ 𝐴 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1569 ifcif 4486 ↦ cmpt 5191 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-if 4487 df-opab 5173 df-mpt 5192 |
| This theorem is used by: psdmvr 22343 |
| Copyright terms: Public domain | W3C validator |