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

Theorem dral2 2445
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 27-Feb-2005.) Allow a shortening of dral1 2446. (Revised by Wolf Lammen, 4-Mar-2018.)
Hypothesis
Ref Expression
dral1.1 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
dral2 (∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜑 ↔ ∀𝑧𝜓))

Proof of Theorem dral2
StepHypRef Expression
1 nfae 2439 . 2 𝑧𝑥 𝑥 = 𝑦
2 dral1.1 . 2 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
31, 2albid 2257 1 (∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜑 ↔ ∀𝑧𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wal 1651
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880
This theorem is referenced by:  dral1ALT  2447  sbal1  2579  sbal2  2580  sbal2OLD  2581  drnfc1  2959  drnfc2  2960  axpownd  9711  wl-sbalnae  33835
  Copyright terms: Public domain W3C validator