Theorem nfbidf 2264

Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 4-Oct-2016.) df-nf 1817 changed. (Revised by Wolf Lammen, 18-Sep-2021.)

Hypotheses

Ref	Expression
albid.1	⊢ Ⅎ𝑥𝜑
albid.2	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
nfbidf	⊢ (𝜑 → (Ⅎ𝑥𝜓 ↔ Ⅎ𝑥𝜒))

Proof of Theorem nfbidf

Step	Hyp	Ref	Expression
1		albid.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2		albid.2	. . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
3	1, 2	exbid 2263	. . 3 ⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))
4	1, 2	albid 2262	. . 3 ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑥𝜒))
5	3, 4	imbi12d 347	. 2 ⊢ (𝜑 → ((∃𝑥𝜓 → ∀𝑥𝜓) ↔ (∃𝑥𝜒 → ∀𝑥𝜒)))
6		df-nf 1817	. 2 ⊢ (Ⅎ𝑥𝜓 ↔ (∃𝑥𝜓 → ∀𝑥𝜓))
7		df-nf 1817	. 2 ⊢ (Ⅎ𝑥𝜒 ↔ (∃𝑥𝜒 → ∀𝑥𝜒))
8	5, 6, 7	3bitr4g 317	1 ⊢ (𝜑 → (Ⅎ𝑥𝜓 ↔ Ⅎ𝑥𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816

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 1945  ax-6 2002  ax-7 2043  ax-12 2216

This proof depends on definitions:  df-bi 210  df-ex 1813  df-nf 1817

This theorem is used by:  drnf2  2476  dvelimdf  2481  nfceqdf  2922  wl-nfimf1  38649  ichnfimlem  48748