| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Negated disjunction in terms of conjunction (DeMorgan's law). Compare Theorem *4.56 of [WhiteheadRussell] p. 120. |
| Ref | Expression |
|---|---|
| ioran |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm4.13 142 |
. . . 4
| |
| 2 | pm4.13 142 |
. . . 4
| |
| 3 | 1, 2 | orbi12i 216 |
. . 3
|
| 4 | 3 | negbii 162 |
. 2
|
| 5 | anor 252 |
. 2
| |
| 6 | 4, 5 | bitr4 154 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: oran 255 pm3.2ni 440 andi 456 dfbi 499 ecase2d 558 ecase3 559 ecased 643 19.43 767 eqvin.l1 851 dfun2 1668 sotrieq 2149 sotrieq2 2150 dfwe2 2187 wereu 2197 ordtri3 2234 ordtri4 2235 ordnbtwn 2316 dflim3 2368 oalimcl 3162 muln0bt 4213 elnnz 4572 elnnz1 4581 om2uzf1o 4656 sqrlem13 4743 cvnbtwn4t 5721 atcvat4 5775 |
| 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 |