Theorem dedhb 3668

Description: A deduction theorem for converting the inference ⊢ Ⅎ𝑥𝐴 => ⊢ 𝜑 into a closed theorem. Use nfa1 2189 and nfab 2933 to eliminate the hypothesis of the substitution instance 𝜓 of the inference. For converting the inference form into a deduction form, abidnf 3667 is useful. (Contributed by NM, 8-Dec-2006.)

Hypotheses

Ref	Expression
dedhb.1	⊢ (𝐴 = {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} → (𝜑 ↔ 𝜓))
dedhb.2	⊢ 𝜓

Assertion

Ref	Expression
dedhb	⊢ (Ⅎ𝑥𝐴 → 𝜑)

Distinct variable groups:   𝑥,𝑧   𝑧,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑧)   𝜓(𝑥, 𝑧)   𝐴(𝑥)

Proof of Theorem dedhb

Step	Hyp	Ref	Expression
1		dedhb.2	. 2 ⊢ 𝜓
2		abidnf 3667	. . . 4 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
3	2	eqcomd 2771	. . 3 ⊢ (Ⅎ𝑥𝐴 → 𝐴 = {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴})
4		dedhb.1	. . 3 ⊢ (𝐴 = {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} → (𝜑 ↔ 𝜓))
5	3, 4	syl 18	. 2 ⊢ (Ⅎ𝑥𝐴 → (𝜑 ↔ 𝜓))
6	1, 5	mpbiri 261	1 ⊢ (Ⅎ𝑥𝐴 → 𝜑)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2146  {cab 2743  Ⅎwnfc 2912

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914

This theorem is used by: (None)