Theorem alimex 1834

Description: An equivalence between an implication with a universally quantified consequent and an implication with an existentially quantified antecedent. An interesting case is when the same formula is substituted for both 𝜑 and 𝜓, since then both implications express a type of nonfreeness. See also eximal 1786. (Contributed by BJ, 12-May-2019.)

Assertion

Ref	Expression
alimex	⊢ ((𝜑 → ∀𝑥𝜓) ↔ (∃𝑥 ¬ 𝜓 → ¬ 𝜑))

Proof of Theorem alimex

Step	Hyp	Ref	Expression
1		alex 1829	. . 3 ⊢ (∀𝑥𝜓 ↔ ¬ ∃𝑥 ¬ 𝜓)
2	1	imbi2i 335	. 2 ⊢ ((𝜑 → ∀𝑥𝜓) ↔ (𝜑 → ¬ ∃𝑥 ¬ 𝜓))
3		con2b 359	. 2 ⊢ ((𝜑 → ¬ ∃𝑥 ¬ 𝜓) ↔ (∃𝑥 ¬ 𝜓 → ¬ 𝜑))
4	2, 3	bitri 274	1 ⊢ ((𝜑 → ∀𝑥𝜓) ↔ (∃𝑥 ¬ 𝜓 → ¬ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205  ∀wal 1537  ∃wex 1783

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813

This theorem depends on definitions:  df-bi 206  df-ex 1784

This theorem is referenced by:  bj-nnfnt  34849