Theorem bj-notalbii 37263

Description: Equivalence of universal quantification of negation of equivalent formulas. Shortens ab0 4339 (103>94), ballotlem2 34911 (2655>2648), bnj1143 35210 (522>519), hausdiag 23839 (2119>2104). (Contributed by BJ, 17-Jul-2021.)

Hypothesis

Ref	Expression
bj-notalbii.1	⊢ (𝜑 ↔ 𝜓)

Assertion

Ref	Expression
bj-notalbii	⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑥 ¬ 𝜓)

Proof of Theorem bj-notalbii

Step	Hyp	Ref	Expression
1		bj-notalbii.1	. . 3 ⊢ (𝜑 ↔ 𝜓)
2	1	notbii 323	. 2 ⊢ (¬ 𝜑 ↔ ¬ 𝜓)
3	2	albii 1852	1 ⊢ (∀𝑥 ¬ 𝜑 ↔ ∀𝑥 ¬ 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1568

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

This proof depends on definitions:  df-bi 210

This theorem is used by: (None)