| 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 2121 and df-clel 2815. (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 2736 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
| 5 | 1, 4 | nfbidf 2236 | . . 3 ⊢ (𝜑 → (Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 6 | 5 | albidv 1927 | . 2 ⊢ (𝜑 → (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 7 | df-nfc 2889 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) | |
| 8 | df-nfc 2889 | . 2 ⊢ (Ⅎ𝑥𝐵 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵) | |
| 9 | 6, 7, 8 | 3bitr4g 315 | 1 ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∀wal 1545 = wceq 1547 Ⅎwnf 1790 ∈ wcel 2119 Ⅎwnfc 2887 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-9 2129 ax-12 2189 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-nf 1791 df-cleq 2732 df-nfc 2889 |
| This theorem is referenced by: nfopd 4828 dfnfc2 4867 nfimad 6028 nffvd 6846 riotasv2d 39450 nfcxfrdf 39459 nfded 39460 nfded2 39461 nfunidALT2 39462 |
| Copyright terms: Public domain | W3C validator |