Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > con2bi | Structured version Visualization version GIF version |
Description: Contraposition. Theorem *4.12 of [WhiteheadRussell] p. 117. (Contributed by NM, 15-Apr-1995.) (Proof shortened by Wolf Lammen, 3-Jan-2013.) |
Ref | Expression |
---|---|
con2bi | ⊢ ((𝜑 ↔ ¬ 𝜓) ↔ (𝜓 ↔ ¬ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | notbi 318 | . 2 ⊢ ((𝜑 ↔ ¬ 𝜓) ↔ (¬ 𝜑 ↔ ¬ ¬ 𝜓)) | |
2 | notnotb 314 | . . 3 ⊢ (𝜓 ↔ ¬ ¬ 𝜓) | |
3 | 2 | bibi2i 337 | . 2 ⊢ ((¬ 𝜑 ↔ 𝜓) ↔ (¬ 𝜑 ↔ ¬ ¬ 𝜓)) |
4 | bicom 221 | . 2 ⊢ ((¬ 𝜑 ↔ 𝜓) ↔ (𝜓 ↔ ¬ 𝜑)) | |
5 | 1, 3, 4 | 3bitr2i 298 | 1 ⊢ ((𝜑 ↔ ¬ 𝜓) ↔ (𝜓 ↔ ¬ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 |
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 206 |
This theorem is referenced by: con2bid 354 nbbn 384 |
Copyright terms: Public domain | W3C validator |