Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > bibif | Structured version Visualization version GIF version |
Description: Transfer negation via an equivalence. (Contributed by NM, 3-Oct-2007.) (Proof shortened by Wolf Lammen, 28-Jan-2013.) |
Ref | Expression |
---|---|
bibif | ⊢ (¬ 𝜓 → ((𝜑 ↔ 𝜓) ↔ ¬ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nbn2 359 | . 2 ⊢ (¬ 𝜓 → (¬ 𝜑 ↔ (𝜓 ↔ 𝜑))) | |
2 | bicom 211 | . 2 ⊢ ((𝜓 ↔ 𝜑) ↔ (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | syl6rbb 276 | 1 ⊢ (¬ 𝜓 → ((𝜑 ↔ 𝜓) ↔ ¬ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 |
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 196 |
This theorem is referenced by: nbn 361 bj-bibibi 31744 or3or 37339 |
Copyright terms: Public domain | W3C validator |