Theorem pm2.21fal 1368

Description: If a wff and its negation are provable, then falsum is provable. (Contributed by Mario Carneiro, 9-Feb-2017.)

Hypotheses

Ref	Expression
pm2.21fal.1	⊢ (𝜑 → 𝜓)
pm2.21fal.2	⊢ (𝜑 → ¬ 𝜓)

Assertion

Ref	Expression
pm2.21fal	⊢ (𝜑 → ⊥)

Proof of Theorem pm2.21fal

Step	Hyp	Ref	Expression
1		pm2.21fal.1	. 2 ⊢ (𝜑 → 𝜓)
2		pm2.21fal.2	. 2 ⊢ (𝜑 → ¬ 𝜓)
3	1, 2	pm2.21dd 615	1 ⊢ (𝜑 → ⊥)

Syntax hints:  ¬ wn 3   → wi 4  ⊥wfal 1353

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-in2 610

This theorem is referenced by:  genpdisj  7485  suplocexprlemdisj  7682  suplocexprlemub  7685  suplocsrlem  7770  recvguniqlem  10958  resqrexlemoverl  10985  leabs  11038  climge0  11288  isprm5lem  12095  dedekindeulemeu  13394  dedekindicclemeu  13403  pw1nct  14036