| 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 2143 and df-clel 2836. (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 2757 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
| 5 | 1, 4 | nfbidf 2258 | . . 3 ⊢ (𝜑 → (Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 6 | 5 | albidv 1948 | . 2 ⊢ (𝜑 → (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 7 | df-nfc 2910 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) | |
| 8 | df-nfc 2910 | . 2 ⊢ (Ⅎ𝑥𝐵 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵) | |
| 9 | 6, 7, 8 | 3bitr4g 317 | 1 ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1566 = wceq 1568 Ⅎwnf 1811 ∈ wcel 2141 Ⅎwnfc 2908 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-9 2151 ax-12 2211 ax-ext 2733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1808 df-nf 1812 df-cleq 2753 df-nfc 2910 |
| This theorem is referenced by: nfopd 4854 dfnfc2 4893 nfimad 6071 nffvd 6893 riotasv2d 39699 nfcxfrdf 39708 nfded 39709 nfded2 39710 nfunidALT2 39711 |
| Copyright terms: Public domain | W3C validator |