| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Absorption of disjunction into equivalence. |
| Ref | Expression |
|---|---|
| oibabs |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1 3 |
. 2
| |
| 2 | orc 225 |
. . . . 5
| |
| 3 | 2 | syl4 19 |
. . . 4
|
| 4 | 3 | ibd 451 |
. . 3
|
| 5 | olc 224 |
. . . . 5
| |
| 6 | 5 | syl4 19 |
. . . 4
|
| 7 | ibib 448 |
. . . . 5
| |
| 8 | bicom 398 |
. . . . . 6
| |
| 9 | 8 | imbi2i 160 |
. . . . 5
|
| 10 | 7, 9 | bitr 151 |
. . . 4
|
| 11 | 6, 10 | sylibr 175 |
. . 3
|
| 12 | 4, 11 | impbid 397 |
. 2
|
| 13 | 1, 12 | impbi 139 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 |