Theorem nbn 700

Description: The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 3-Oct-2013.)

Hypothesis

Ref	Expression
nbn.1	⊢ ¬ 𝜑

Assertion

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

Proof of Theorem nbn

Step	Hyp	Ref	Expression
1		nbn.1	. . 3 ⊢ ¬ 𝜑
2		bibif 699	. . 3 ⊢ (¬ 𝜑 → ((𝜓 ↔ 𝜑) ↔ ¬ 𝜓))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝜓 ↔ 𝜑) ↔ ¬ 𝜓)
4	3	bicomi 132	1 ⊢ (¬ 𝜓 ↔ (𝜓 ↔ 𝜑))

Syntax hints:  ¬ wn 3   ↔ wb 105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  nbn3  701  nbfal  1375  n0rf  3459  eq0  3465  disj  3495  dm0rn0  4879  reldm0  4880