Theorem nfceqdf 2298

Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 14-Oct-2016.)

Hypotheses

Ref	Expression
nfceqdf.1	⊢ Ⅎ𝑥𝜑
nfceqdf.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
nfceqdf	⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵))

Proof of Theorem nfceqdf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfceqdf.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2		nfceqdf.2	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
3	2	eleq2d 2227	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
4	1, 3	nfbidf 1519	. . 3 ⊢ (𝜑 → (Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐵))
5	4	albidv 1804	. 2 ⊢ (𝜑 → (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵))
6		df-nfc 2288	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
7		df-nfc 2288	. 2 ⊢ (Ⅎ𝑥𝐵 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵)
8	5, 6, 7	3bitr4g 222	1 ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵))

Syntax hints:   → wi 4   ↔ wb 104  ∀wal 1333   = wceq 1335  Ⅎwnf 1440   ∈ wcel 2128  Ⅎwnfc 2286

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1427  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-4 1490  ax-17 1506  ax-ial 1514  ax-ext 2139

This theorem depends on definitions:  df-bi 116  df-nf 1441  df-cleq 2150  df-clel 2153  df-nfc 2288

This theorem is referenced by:  nfopd  3759  dfnfc2  3791  nfimad  4938  nffvd  5481