Theorem imnang 1871

Description: Quantified implication in terms of quantified negation of conjunction. (Contributed by BJ, 16-Jul-2021.)

Assertion

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

Proof of Theorem imnang

Step	Hyp	Ref	Expression
1		imnan 404	. 2 ⊢ ((𝜑 → ¬ 𝜓) ↔ ¬ (𝜑 ∧ 𝜓))
2	1	albii 1848	1 ⊢ (∀𝑥(𝜑 → ¬ 𝜓) ↔ ∀𝑥 ¬ (𝜑 ∧ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838

This proof depends on definitions:  df-bi 210  df-an 401

This theorem is used by:  alinexa  1872  raln  3087  rexab  3657  n0el  4318  ballotlem2  34888