| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > drnf2 | Structured version Visualization version GIF version | ||
| Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.) (Proof shortened by Wolf Lammen, 5-May-2018.) Usage of this theorem is discouraged because it depends on ax-13 2410. Use nfbidv 1949 instead. (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dral1.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| drnf2 | ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 ↔ Ⅎ𝑧𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfae 2471 | . 2 ⊢ Ⅎ𝑧∀𝑥 𝑥 = 𝑦 | |
| 2 | dral1.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | nfbidf 2266 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 ↔ Ⅎ𝑧𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1565 Ⅎwnf 1810 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-10 2182 ax-11 2198 ax-12 2219 ax-13 2410 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-nf 1811 |
| This theorem is referenced by: nfsb4t 2537 drnfc2 2951 |
| Copyright terms: Public domain | W3C validator |