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

Theorem drnf1v 2400
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Version of drnf1 2472 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by Mario Carneiro, 4-Oct-2016.) (Revised by BJ, 17-Jun-2019.) Avoid ax-10 2177. (Revised by GG, 18-Nov-2024.)
Hypothesis
Ref Expression
dral1v.1 (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
drnf1v (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)

Proof of Theorem drnf1v
StepHypRef Expression
1 dral1v.1 . . . 4 (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
21drex1v 2399 . . 3 (∀𝑥 𝑥 = 𝑦 → (∃𝑥𝜑 ↔ ∃𝑦𝜓))
31dral1v 2398 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))
42, 3imbi12d 347 . 2 (∀𝑥 𝑥 = 𝑦 → ((∃𝑥𝜑 → ∀𝑥𝜑) ↔ (∃𝑦𝜓 → ∀𝑦𝜓)))
5 df-nf 1816 . 2 (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
6 df-nf 1816 . 2 (Ⅎ𝑦𝜓 ↔ (∃𝑦𝜓 → ∀𝑦𝜓))
74, 5, 63bitr4g 317 1 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567  ∃wex 1811  Ⅎwnf 1815
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-nf 1816
This theorem is used by:  nfriotadw  7386
  Copyright terms: Public domain W3C validator