Metamath Proof Explorer


Theorem biimpr

Description: Property of the biconditional connective. (Contributed by NM, 11-May-1999) (Proof shortened by Wolf Lammen, 11-Nov-2012)

Ref Expression
Assertion biimpr ( ( 𝜑𝜓 ) → ( 𝜓𝜑 ) )

Proof

Step Hyp Ref Expression
1 dfbi1 ( ( 𝜑𝜓 ) ↔ ¬ ( ( 𝜑𝜓 ) → ¬ ( 𝜓𝜑 ) ) )
2 simprim ( ¬ ( ( 𝜑𝜓 ) → ¬ ( 𝜓𝜑 ) ) → ( 𝜓𝜑 ) )
3 1 2 sylbi ( ( 𝜑𝜓 ) → ( 𝜓𝜑 ) )