Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nbbn | Structured version Visualization version GIF version |
Description: Move negation outside of biconditional. Compare Theorem *5.18 of [WhiteheadRussell] p. 124. (Contributed by NM, 27-Jun-2002.) (Proof shortened by Wolf Lammen, 20-Sep-2013.) |
Ref | Expression |
---|---|
nbbn | ⊢ ((¬ 𝜑 ↔ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xor3 384 | . 2 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ (𝜑 ↔ ¬ 𝜓)) | |
2 | con2bi 355 | . 2 ⊢ ((𝜑 ↔ ¬ 𝜓) ↔ (𝜓 ↔ ¬ 𝜑)) | |
3 | bicom 223 | . 2 ⊢ ((𝜓 ↔ ¬ 𝜑) ↔ (¬ 𝜑 ↔ 𝜓)) | |
4 | 1, 2, 3 | 3bitrri 299 | 1 ⊢ ((¬ 𝜑 ↔ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 207 |
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 208 |
This theorem is referenced by: biass 386 pclem6 1019 xorass 1499 hadbi 1589 canth 7100 qextltlem 12583 onint1 33694 notbinot1 35238 notbinot2 35242 |
Copyright terms: Public domain | W3C validator |