Theorem exanaliim 1658

Description: A transformation of quantifiers and logical connectives. In classical logic the converse also holds. (Contributed by Jim Kingdon, 15-Jul-2018.)

Assertion

Ref	Expression
exanaliim	⊢ (∃𝑥(𝜑 ∧ ¬ 𝜓) → ¬ ∀𝑥(𝜑 → 𝜓))

Proof of Theorem exanaliim

Step	Hyp	Ref	Expression
1		annimim 687	. . 3 ⊢ ((𝜑 ∧ ¬ 𝜓) → ¬ (𝜑 → 𝜓))
2	1	eximi 1611	. 2 ⊢ (∃𝑥(𝜑 ∧ ¬ 𝜓) → ∃𝑥 ¬ (𝜑 → 𝜓))
3		exnalim 1657	. 2 ⊢ (∃𝑥 ¬ (𝜑 → 𝜓) → ¬ ∀𝑥(𝜑 → 𝜓))
4	2, 3	syl 14	1 ⊢ (∃𝑥(𝜑 ∧ ¬ 𝜓) → ¬ ∀𝑥(𝜑 → 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104  ∀wal 1362  ∃wex 1503

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-4 1521  ax-17 1537  ax-ial 1545

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472

This theorem is referenced by:  rexnalim  2483  nssr  3239  nssssr  4251  brprcneu  5547