Theorem conimpfalt 47715

Description: Assuming a, not b, and a implies b, there exists a proof that a is false.) (Contributed by Jarvin Udandy, 29-Aug-2016.)

Hypotheses

Ref	Expression
conimpfalt.1	⊢ 𝜑
conimpfalt.2	⊢ ¬ 𝜓
conimpfalt.3	⊢ (𝜑 → 𝜓)

Assertion

Ref	Expression
conimpfalt	⊢ (𝜑 ↔ ⊥)

Proof of Theorem conimpfalt

Step	Hyp	Ref	Expression
1		conimpfalt.3	. 2 ⊢ (𝜑 → 𝜓)
2		conimpfalt.2	. 2 ⊢ ¬ 𝜓
3	1, 2	aibnbaif 47704	1 ⊢ (𝜑 ↔ ⊥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ⊥wfal 1582

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  df-tru 1573  df-fal 1583

This theorem is used by: (None)