Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > drnfc2 | Structured version Visualization version GIF version |
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Proof revision is marked as discouraged because the minimizer replaces albidv 1920 with dral2 2459, leading to a one byte longer proof. However feel free to manually edit it according to conventions. Usage of this theorem is discouraged because it depends on ax-13 2389. (Contributed by Mario Carneiro, 8-Oct-2016.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
drnfc1.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
drnfc2 | ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | drnfc1.1 | . . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) | |
2 | 1 | eleq2d 2901 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐵)) |
3 | 2 | drnf2 2465 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧 𝑤 ∈ 𝐴 ↔ Ⅎ𝑧 𝑤 ∈ 𝐵)) |
4 | 3 | albidv 1920 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐴 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐵)) |
5 | df-nfc 2966 | . 2 ⊢ (Ⅎ𝑧𝐴 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐴) | |
6 | df-nfc 2966 | . 2 ⊢ (Ⅎ𝑧𝐵 ↔ ∀𝑤Ⅎ𝑧 𝑤 ∈ 𝐵) | |
7 | 4, 5, 6 | 3bitr4g 316 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1534 = wceq 1536 Ⅎwnf 1783 ∈ wcel 2113 Ⅎwnfc 2964 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-13 2389 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1539 df-ex 1780 df-nf 1784 df-cleq 2817 df-clel 2896 df-nfc 2966 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |