| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ovif12 | Structured version Visualization version GIF version | ||
| Description: Move a conditional outside of an operation. (Contributed by Thierry Arnoux, 25-Jan-2017.) |
| Ref | Expression |
|---|---|
| ovif12 | ⊢ (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iftrue 4497 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 2 | iftrue 4497 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐶, 𝐷) = 𝐶) | |
| 3 | 1, 2 | oveq12d 7408 | . . 3 ⊢ (𝜑 → (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = (𝐴𝐹𝐶)) |
| 4 | iftrue 4497 | . . 3 ⊢ (𝜑 → if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷)) = (𝐴𝐹𝐶)) | |
| 5 | 3, 4 | eqtr4d 2768 | . 2 ⊢ (𝜑 → (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷))) |
| 6 | iffalse 4500 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 7 | iffalse 4500 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐶, 𝐷) = 𝐷) | |
| 8 | 6, 7 | oveq12d 7408 | . . 3 ⊢ (¬ 𝜑 → (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = (𝐵𝐹𝐷)) |
| 9 | iffalse 4500 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷)) = (𝐵𝐹𝐷)) | |
| 10 | 8, 9 | eqtr4d 2768 | . 2 ⊢ (¬ 𝜑 → (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷))) |
| 11 | 5, 10 | pm2.61i 182 | 1 ⊢ (if(𝜑, 𝐴, 𝐵)𝐹if(𝜑, 𝐶, 𝐷)) = if(𝜑, (𝐴𝐹𝐶), (𝐵𝐹𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 = wceq 1540 ifcif 4491 (class class class)co 7390 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-iota 6467 df-fv 6522 df-ov 7393 |
| This theorem is referenced by: ofccat 14942 limccnp2 25800 ftc1anclem5 37698 fsuppind 42585 sqrtcval 43637 |
| Copyright terms: Public domain | W3C validator |