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

Theorem dral1ALT 2447
Description: Alternate proof of dral1 2446, shorter but requiring ax-11 2200. (Contributed by NM, 24-Nov-1994.) (Proof shortened by Wolf Lammen, 22-Apr-2018.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
dral1.1 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
dral1ALT (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))

Proof of Theorem dral1ALT
StepHypRef Expression
1 dral1.1 . . 3 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
21dral2 2445 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑥𝜓))
3 axc11 2437 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 → ∀𝑦𝜓))
4 axc11r 2376 . . 3 (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑥𝜓))
53, 4impbid 204 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 ↔ ∀𝑦𝜓))
62, 5bitrd 271 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: (None)
  Copyright terms: Public domain W3C validator