Theorem notbinot2 38762

Description: Commutation rule between negation and biconditional. (Contributed by Giovanni Mascellani, 15-Sep-2017.)

Assertion

Ref	Expression
notbinot2	⊢ (¬ (𝜑 ↔ 𝜓) ↔ (¬ 𝜑 ↔ 𝜓))

Proof of Theorem notbinot2

Step	Hyp	Ref	Expression
1		nbbn 386	. 2 ⊢ ((¬ 𝜑 ↔ 𝜓) ↔ ¬ (𝜑 ↔ 𝜓))
2	1	bicomi 227	1 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ (¬ 𝜑 ↔ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This proof depends on definitions:  df-bi 210

This theorem is used by:  biimpor  38763