MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  notbi Structured version   Visualization version   GIF version

Theorem notbi 307
Description: Contraposition. Theorem *4.11 of [WhiteheadRussell] p. 117. (Contributed by NM, 21-May-1994.) (Proof shortened by Wolf Lammen, 12-Jun-2013.)
Assertion
Ref Expression
notbi ((𝜑𝜓) ↔ (¬ 𝜑 ↔ ¬ 𝜓))

Proof of Theorem notbi
StepHypRef Expression
1 id 22 . . 3 ((𝜑𝜓) → (𝜑𝜓))
21notbid 306 . 2 ((𝜑𝜓) → (¬ 𝜑 ↔ ¬ 𝜓))
3 id 22 . . 3 ((¬ 𝜑 ↔ ¬ 𝜓) → (¬ 𝜑 ↔ ¬ 𝜓))
43con4bid 305 . 2 ((¬ 𝜑 ↔ ¬ 𝜓) → (𝜑𝜓))
52, 4impbii 197 1 ((𝜑𝜓) ↔ (¬ 𝜑 ↔ ¬ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 194
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 195
This theorem is referenced by:  notbii  308  con4bii  309  con2bi  341  nbn2  358  pm5.32  665  hadnot  1531  had0  1533  cbvexd  2264  symdifass  3814  isocnv3  6460  suppimacnv  7170  sumodd  14895  f1omvdco3  17638  onsuct0  31416  bj-cbvexdv  31729  ifpbi1  36644  ifpbi13  36656  abciffcbatnabciffncba  39549  abciffcbatnabciffncbai  39550
  Copyright terms: Public domain W3C validator