|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > nbn2 | Structured version Visualization version GIF version | ||
| Description: The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by Juha Arpiainen, 19-Jan-2006.) (Proof shortened by Wolf Lammen, 28-Jan-2013.) | 
| Ref | Expression | 
|---|---|
| nbn2 | ⊢ (¬ 𝜑 → (¬ 𝜓 ↔ (𝜑 ↔ 𝜓))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | pm5.501 366 | . 2 ⊢ (¬ 𝜑 → (¬ 𝜓 ↔ (¬ 𝜑 ↔ ¬ 𝜓))) | |
| 2 | notbi 319 | . 2 ⊢ ((𝜑 ↔ 𝜓) ↔ (¬ 𝜑 ↔ ¬ 𝜓)) | |
| 3 | 1, 2 | bitr4di 289 | 1 ⊢ (¬ 𝜑 → (¬ 𝜓 ↔ (𝜑 ↔ 𝜓))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 | 
| This theorem depends on definitions: df-bi 207 | 
| This theorem is referenced by: bibif 371 pm5.21im 374 pm5.18 381 biass 384 sadadd2lem2 16487 isclo 23095 | 
| Copyright terms: Public domain | W3C validator |