![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfceqdf | Structured version Visualization version GIF version |
Description: An equality theorem for effectively not free. (Contributed by Mario Carneiro, 14-Oct-2016.) Avoid ax-8 2107 and df-clel 2809. (Revised by WL and SN, 23-Aug-2024.) |
Ref | Expression |
---|---|
nfceqdf.1 | ⊢ Ⅎ𝑥𝜑 |
nfceqdf.2 | ⊢ (𝜑 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
nfceqdf | ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfceqdf.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
2 | nfceqdf.2 | . . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵) | |
3 | eleq2w2 2727 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) | |
4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
5 | 1, 4 | nfbidf 2216 | . . 3 ⊢ (𝜑 → (Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐵)) |
6 | 5 | albidv 1922 | . 2 ⊢ (𝜑 → (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵)) |
7 | df-nfc 2884 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) | |
8 | df-nfc 2884 | . 2 ⊢ (Ⅎ𝑥𝐵 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵) | |
9 | 6, 7, 8 | 3bitr4g 314 | 1 ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1538 = wceq 1540 Ⅎwnf 1784 ∈ wcel 2105 Ⅎwnfc 2882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-9 2115 ax-12 2170 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1781 df-nf 1785 df-cleq 2723 df-nfc 2884 |
This theorem is referenced by: nfopd 4890 dfnfc2 4933 nfimad 6068 nffvd 6903 riotasv2d 38293 nfcxfrdf 38302 nfded 38303 nfded2 38304 nfunidALT2 38305 |
Copyright terms: Public domain | W3C validator |