Metamath Proof Explorer


Theorem dedhb

Description: A deduction theorem for converting the inference |- F/_ x A => |- ph into a closed theorem. Use nfa1 and nfab to eliminate the hypothesis of the substitution instance ps of the inference. For converting the inference form into a deduction form, abidnf is useful. (Contributed by NM, 8-Dec-2006)

Ref Expression
Hypotheses dedhb.1 ( 𝐴 = { 𝑧 ∣ ∀ 𝑥 𝑧𝐴 } → ( 𝜑𝜓 ) )
dedhb.2 𝜓
Assertion dedhb ( 𝑥 𝐴𝜑 )

Proof

Step Hyp Ref Expression
1 dedhb.1 ( 𝐴 = { 𝑧 ∣ ∀ 𝑥 𝑧𝐴 } → ( 𝜑𝜓 ) )
2 dedhb.2 𝜓
3 abidnf ( 𝑥 𝐴 → { 𝑧 ∣ ∀ 𝑥 𝑧𝐴 } = 𝐴 )
4 3 eqcomd ( 𝑥 𝐴𝐴 = { 𝑧 ∣ ∀ 𝑥 𝑧𝐴 } )
5 4 1 syl ( 𝑥 𝐴 → ( 𝜑𝜓 ) )
6 2 5 mpbiri ( 𝑥 𝐴𝜑 )