| 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 2134 and df-clel 2827. (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 2748 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)) |
| 5 | 1, 4 | nfbidf 2249 | . . 3 ⊢ (𝜑 → (Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 6 | 5 | albidv 1930 | . 2 ⊢ (𝜑 → (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵)) |
| 7 | df-nfc 2901 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴) | |
| 8 | df-nfc 2901 | . 2 ⊢ (Ⅎ𝑥𝐵 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐵) | |
| 9 | 6, 7, 8 | 3bitr4g 316 | 1 ⊢ (𝜑 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑥𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∀wal 1548 = wceq 1550 Ⅎwnf 1793 ∈ wcel 2132 Ⅎwnfc 2899 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-9 2142 ax-12 2202 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1790 df-nf 1794 df-cleq 2744 df-nfc 2901 |
| This theorem is referenced by: nfopd 4838 dfnfc2 4877 nfimad 6044 nffvd 6864 riotasv2d 39519 nfcxfrdf 39528 nfded 39529 nfded2 39530 nfunidALT2 39531 |
| Copyright terms: Public domain | W3C validator |