Theorem bj-nnfnfTEMP 37393

Description: New nonfreeness implies old nonfreeness on minimal implicational calculus (the proof indicates it uses ax-3 8 because of set.mm's definition of the biconditional, but the proof actually holds in minimal implicational calculus). (Contributed by BJ, 28-Jul-2023.) The proof should not rely on df-nf 1813 except via df-nf 1813 directly. (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nnfnfTEMP	⊢ (Ⅎ'𝑥𝜑 → Ⅎ𝑥𝜑)

Proof of Theorem bj-nnfnfTEMP

Step	Hyp	Ref	Expression
1		bj-nnfea 37387	. 2 ⊢ (Ⅎ'𝑥𝜑 → (∃𝑥𝜑 → ∀𝑥𝜑))
2		df-nf 1813	. 2 ⊢ (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
3	1, 2	sylibr 237	1 ⊢ (Ⅎ'𝑥𝜑 → Ⅎ𝑥𝜑)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567  ∃wex 1808  Ⅎwnf 1812  Ⅎ'wnnf 37379

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

This proof depends on definitions:  df-bi 210  df-an 401  df-nf 1813  df-bj-nnf 37380

This theorem is used by: (None)