Theorem alinexa 1617

Description: A transformation of quantifiers and logical connectives. (Contributed by NM, 19-Aug-1993.)

Assertion

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

Proof of Theorem alinexa

Step	Hyp	Ref	Expression
1		imnan 691	. . 3 ⊢ ((𝜑 → ¬ 𝜓) ↔ ¬ (𝜑 ∧ 𝜓))
2	1	albii 1484	. 2 ⊢ (∀𝑥(𝜑 → ¬ 𝜓) ↔ ∀𝑥 ¬ (𝜑 ∧ 𝜓))
3		alnex 1513	. 2 ⊢ (∀𝑥 ¬ (𝜑 ∧ 𝜓) ↔ ¬ ∃𝑥(𝜑 ∧ 𝜓))
4	2, 3	bitri 184	1 ⊢ (∀𝑥(𝜑 → ¬ 𝜓) ↔ ¬ ∃𝑥(𝜑 ∧ 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1362  ∃wex 1506

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 1461  ax-gen 1463  ax-ie2 1508

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

This theorem is referenced by:  sbnv  1903  ralnex  2485