Theorem nfnbi 1836

Description: A variable is non-free in a proposition if and only if it is so in its negation. (Contributed by BJ, 6-May-2019.)

Assertion

Ref	Expression
nfnbi	⊢ (Ⅎ𝑥𝜑 ↔ Ⅎ𝑥 ¬ 𝜑)

Proof of Theorem nfnbi

Step	Hyp	Ref	Expression
1		orcom 865	. 2 ⊢ ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) ↔ (∀𝑥 ¬ 𝜑 ∨ ∀𝑥𝜑))
2		nf3 1768	. 2 ⊢ (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))
3		nf3 1768	. . 3 ⊢ (Ⅎ𝑥 ¬ 𝜑 ↔ (∀𝑥 ¬ 𝜑 ∨ ∀𝑥 ¬ ¬ 𝜑))
4		notnotb 316	. . . . 5 ⊢ (𝜑 ↔ ¬ ¬ 𝜑)
5	4	albii 1801	. . . 4 ⊢ (∀𝑥𝜑 ↔ ∀𝑥 ¬ ¬ 𝜑)
6	5	orbi2i 907	. . 3 ⊢ ((∀𝑥 ¬ 𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥 ¬ 𝜑 ∨ ∀𝑥 ¬ ¬ 𝜑))
7	3, 6	bitr4i 279	. 2 ⊢ (Ⅎ𝑥 ¬ 𝜑 ↔ (∀𝑥 ¬ 𝜑 ∨ ∀𝑥𝜑))
8	1, 2, 7	3bitr4i 304	1 ⊢ (Ⅎ𝑥𝜑 ↔ Ⅎ𝑥 ¬ 𝜑)

Syntax hints:  ¬ wn 3   ↔ wb 207   ∨ wo 842  ∀wal 1520  Ⅎwnf 1765

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791

This theorem depends on definitions:  df-bi 208  df-or 843  df-ex 1762  df-nf 1766

This theorem is referenced by:  nfnt  1837  wl-sb8et  34320