Theorem nbn 375

Description: The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by NM, 21-Jun-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 374	. . 3 ⊢ (¬ 𝜑 → ((𝜓 ↔ 𝜑) ↔ ¬ 𝜓))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝜓 ↔ 𝜑) ↔ ¬ 𝜓)
4	3	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:  nbn3  376  nbfal  1585  eq0f  4294  eq0ALT  4298  disj  4403  axnulALT  5258  dm0rn0  5906  dm0rn0OLD  5907  reldm0  5910  isarchi  33736  axnulALT2  35704  axsepg2  35791  axsepg4  35794