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

Theorem dral1 2461
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Usage of this theorem is discouraged because it depends on ax-13 2390. Use the weaker dral1v 2387 if possible. (Contributed by NM, 24-Nov-1994.) Remove dependency on ax-11 2161. (Revised by Wolf Lammen, 6-Sep-2018.) (New usage is discouraged.)
Hypothesis
Ref Expression
dral1.1 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
dral1 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))

Proof of Theorem dral1
StepHypRef Expression
1 nfa1 2155 . . 3 𝑥𝑥 𝑥 = 𝑦
2 dral1.1 . . 3 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
31, 2albid 2224 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑥𝜓))
4 axc11 2452 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 → ∀𝑦𝜓))
5 axc11r 2386 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑥𝜓))
64, 5impbid 214 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 ↔ ∀𝑦𝜓))
73, 6bitrd 281 1 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2145  ax-12 2177  ax-13 2390
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1781  df-nf 1785
This theorem is referenced by:  drex1  2463  drnf1  2465  axc16gALT  2529  sb9  2561  ralcom2  3365  axpownd  10025  wl-dral1d  34773  wl-ax11-lem5  34823  wl-ax11-lem8  34826  wl-ax11-lem9  34827
  Copyright terms: Public domain W3C validator