Theorem pm5.21im 363

Description: Two propositions are equivalent if they are both false. Closed form of 2false 364. Equivalent to a biimpr 209-like version of the xor-connective. (Contributed by Wolf Lammen, 13-May-2013.)

Assertion

Ref	Expression
pm5.21im	⊢ (¬ 𝜑 → (¬ 𝜓 → (𝜑 ↔ 𝜓)))

Proof of Theorem pm5.21im

Step	Hyp	Ref	Expression
1		nbn2 359	. 2 ⊢ (¬ 𝜑 → (¬ 𝜓 ↔ (𝜑 ↔ 𝜓)))
2	1	biimpd 218	1 ⊢ (¬ 𝜑 → (¬ 𝜓 → (𝜑 ↔ 𝜓)))

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:  pm5.21ndd  368  pm5.21  899