Metamath Proof Explorer


Theorem bj-nnf-spim

Description: A universal specialization result in deduction form, proved from ax-1 -- ax-6 , where the only DV condition is on x , y and where x should be nonfree in the new proposition ch (and in the context ph ). (Contributed by BJ, 4-Apr-2026)

Ref Expression
Hypotheses bj-nnf-spim.nf0 ⊢ ( 𝜑 → ∀ 𝑥 𝜑 )
bj-nnf-spim.nf ⊢ ( 𝜑 → Ⅎ' 𝑥 𝜒 )
bj-nnf-spim.is ⊢ ( ( 𝜑 ∧ 𝑥 = 𝑦 ) → ( 𝜓 → 𝜒 ) )
Assertion bj-nnf-spim ( 𝜑 → ( ∀ 𝑥 𝜓 → 𝜒 ) )

Proof

Step Hyp Ref Expression
1 bj-nnf-spim.nf0 ⊢ ( 𝜑 → ∀ 𝑥 𝜑 )
2 bj-nnf-spim.nf ⊢ ( 𝜑 → Ⅎ' 𝑥 𝜒 )
3 bj-nnf-spim.is ⊢ ( ( 𝜑 ∧ 𝑥 = 𝑦 ) → ( 𝜓 → 𝜒 ) )
4 2 bj-nnfed ⊢ ( 𝜑 → ( ∃ 𝑥 𝜒 → 𝜒 ) )
5 1 4 3 bj-spim0 ⊢ ( 𝜑 → ( ∀ 𝑥 𝜓 → 𝜒 ) )