| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A wff is equivalent to its disjunction with falsehood. |
| Ref | Expression |
|---|---|
| biorfi.1 |
|
| Ref | Expression |
|---|---|
| biorfi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | biorfi.1 |
. . 3
| |
| 2 | biorf 551 |
. . 3
| |
| 3 | 1, 2 | ax-mp 6 |
. 2
|
| 4 | orcom 209 |
. 2
| |
| 5 | 3, 4 | bitr 151 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: un0 1721 opthprc 2457 imadif 2714 |
| 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 |