| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > drnfc1 | Structured version Visualization version GIF version | ||
| Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 2377. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-8 2111, ax-11 2158. (Revised by Wolf Lammen, 22-Sep-2024.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| drnfc1.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| drnfc1 | ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑦𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | drnfc1.1 | . . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) | |
| 2 | eleq2w2 2732 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵)) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵)) |
| 4 | 3 | drnf1 2448 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥 𝑤 ∈ 𝐴 ↔ Ⅎ𝑦 𝑤 ∈ 𝐵)) |
| 5 | 4 | albidv 1920 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑤Ⅎ𝑥 𝑤 ∈ 𝐴 ↔ ∀𝑤Ⅎ𝑦 𝑤 ∈ 𝐵)) |
| 6 | df-nfc 2886 | . 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑤Ⅎ𝑥 𝑤 ∈ 𝐴) | |
| 7 | df-nfc 2886 | . 2 ⊢ (Ⅎ𝑦𝐵 ↔ ∀𝑤Ⅎ𝑦 𝑤 ∈ 𝐵) | |
| 8 | 5, 6, 7 | 3bitr4g 314 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑦𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1538 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 Ⅎwnfc 2884 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-9 2119 ax-10 2142 ax-12 2178 ax-13 2377 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ex 1780 df-nf 1784 df-cleq 2728 df-nfc 2886 |
| This theorem is referenced by: nfabd2 2923 nfcvb 5351 nfriotad 7378 bj-nfcsym 36922 |
| Copyright terms: Public domain | W3C validator |