Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ifor | Structured version Visualization version Unicode version |
Description: Rewrite a disjunction in an if statement as two nested conditionals. (Contributed by Mario Carneiro, 28-Jul-2014.) |
Ref | Expression |
---|---|
ifor |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iftrue 4092 | . . . 4 | |
2 | 1 | orcs 409 | . . 3 |
3 | iftrue 4092 | . . 3 | |
4 | 2, 3 | eqtr4d 2659 | . 2 |
5 | iffalse 4095 | . . 3 | |
6 | biorf 420 | . . . 4 | |
7 | 6 | ifbid 4108 | . . 3 |
8 | 5, 7 | eqtr2d 2657 | . 2 |
9 | 4, 8 | pm2.61i 176 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wo 383 wceq 1483 cif 4086 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-if 4087 |
This theorem is referenced by: cantnflem1d 8585 cantnflem1 8586 |
Copyright terms: Public domain | W3C validator |