Theorem alinexa 724

Description: A transformation of quantifiers and logical connectives.

Assertion

Ref	Expression
alinexa	⊢ (∀x(φ → ¬ ψ) ↔ ¬ ∃x(φ ∧ ψ))

Proof of Theorem alinexa

Step	Hyp	Ref	Expression
1		imnan 207	. . 3 ⊢ ((φ → ¬ ψ) ↔ ¬ (φ ∧ ψ))
2	1	bial 695	. 2 ⊢ (∀x(φ → ¬ ψ) ↔ ∀x ¬ (φ ∧ ψ))
3		alnex 716	. 2 ⊢ (∀x ¬ (φ ∧ ψ) ↔ ¬ ∃x(φ ∧ ψ))
4	2, 3	bitr 151	1 ⊢ (∀x(φ → ¬ ψ) ↔ ¬ ∃x(φ ∧ ψ))

Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   ∧ wa 196  ∀wal 672  ∃wex 678

This theorem is referenced by:  eqs3 830  ralnex 1209  zornlem4 3606  suplem2pr 3956  nnunb 4520

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-gen 677

This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679

metamath.org