MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  drnf1 Structured version   Visualization version   GIF version

Theorem drnf1 2458
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 2383. Use the weaker drnf1v 2382 if possible. (Contributed by Mario Carneiro, 4-Oct-2016.) (New usage is discouraged.)
Hypothesis
Ref Expression
dral1.1 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
drnf1 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓))

Proof of Theorem drnf1
StepHypRef Expression
1 dral1.1 . . . 4 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
21dral1 2454 . . . 4 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))
31, 2imbi12d 347 . . 3 (∀𝑥 𝑥 = 𝑦 → ((𝜑 → ∀𝑥𝜑) ↔ (𝜓 → ∀𝑦𝜓)))
43dral1 2454 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝜑 → ∀𝑥𝜑) ↔ ∀𝑦(𝜓 → ∀𝑦𝜓)))
5 nf5 2283 . 2 (Ⅎ𝑥𝜑 ↔ ∀𝑥(𝜑 → ∀𝑥𝜑))
6 nf5 2283 . 2 (Ⅎ𝑦𝜓 ↔ ∀𝑦(𝜓 → ∀𝑦𝜓))
74, 5, 63bitr4g 316 1 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1528  wnf 1777
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-10 2138  ax-12 2169  ax-13 2383
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1774  df-nf 1778
This theorem is referenced by:  nfald2  2460  drnfc1  2995  drnfc1OLD  2996  wl-nfs1t  34769
  Copyright terms: Public domain W3C validator