![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > drnf1 | Structured version Visualization version GIF version |
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2371. Use drnf1v 2369 instead. (New usage is discouraged.) |
Ref | Expression |
---|---|
dral1.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
drnf1 | ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dral1.1 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
2 | 1 | dral1 2438 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓)) |
3 | 1, 2 | imbi12d 345 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝜑 → ∀𝑥𝜑) ↔ (𝜓 → ∀𝑦𝜓))) |
4 | 3 | dral1 2438 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝜑 → ∀𝑥𝜑) ↔ ∀𝑦(𝜓 → ∀𝑦𝜓))) |
5 | nf5 2279 | . 2 ⊢ (Ⅎ𝑥𝜑 ↔ ∀𝑥(𝜑 → ∀𝑥𝜑)) | |
6 | nf5 2279 | . 2 ⊢ (Ⅎ𝑦𝜓 ↔ ∀𝑦(𝜓 → ∀𝑦𝜓)) | |
7 | 4, 5, 6 | 3bitr4g 314 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1540 Ⅎwnf 1786 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-10 2138 ax-12 2172 ax-13 2371 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-ex 1783 df-nf 1787 |
This theorem is referenced by: nfald2 2444 drnfc1 2927 drnfc1OLD 2928 wl-nfs1t 36025 |
Copyright terms: Public domain | W3C validator |