Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ifor | Structured version Visualization version GIF version |
Description: Rewrite a disjunction in a conditional as two nested conditionals. (Contributed by Mario Carneiro, 28-Jul-2014.) |
Ref | Expression |
---|---|
ifor | ⊢ if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iftrue 4475 | . . . 4 ⊢ ((𝜑 ∨ 𝜓) → if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = 𝐴) | |
2 | 1 | orcs 871 | . . 3 ⊢ (𝜑 → if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = 𝐴) |
3 | iftrue 4475 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵)) = 𝐴) | |
4 | 2, 3 | eqtr4d 2861 | . 2 ⊢ (𝜑 → if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵))) |
5 | iffalse 4478 | . . 3 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵)) = if(𝜓, 𝐴, 𝐵)) | |
6 | biorf 933 | . . . 4 ⊢ (¬ 𝜑 → (𝜓 ↔ (𝜑 ∨ 𝜓))) | |
7 | 6 | ifbid 4491 | . . 3 ⊢ (¬ 𝜑 → if(𝜓, 𝐴, 𝐵) = if((𝜑 ∨ 𝜓), 𝐴, 𝐵)) |
8 | 5, 7 | eqtr2d 2859 | . 2 ⊢ (¬ 𝜑 → if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵))) |
9 | 4, 8 | pm2.61i 184 | 1 ⊢ if((𝜑 ∨ 𝜓), 𝐴, 𝐵) = if(𝜑, 𝐴, if(𝜓, 𝐴, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∨ wo 843 = wceq 1537 ifcif 4469 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ex 1781 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-if 4470 |
This theorem is referenced by: cantnflem1d 9153 cantnflem1 9154 |
Copyright terms: Public domain | W3C validator |