Metamath Proof Explorer


Theorem nbior

Description: If two propositions are not equivalent, then at least one is true. (Contributed by BJ, 19-Apr-2019) (Proof shortened by Wolf Lammen, 19-Jan-2020)

Ref Expression
Assertion nbior ( ¬ ( 𝜑𝜓 ) → ( 𝜑𝜓 ) )

Proof

Step Hyp Ref Expression
1 norbi ( ¬ ( 𝜑𝜓 ) → ( 𝜑𝜓 ) )
2 1 con1i ( ¬ ( 𝜑𝜓 ) → ( 𝜑𝜓 ) )