Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dral2-o Structured version   Visualization version   GIF version

Theorem dral2-o 40080
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Version of dral2 2467 using ax-c11 40037. (Contributed by NM, 27-Feb-2005.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
dral2-o.1 (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
dral2-o (∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜑 ↔ ∀𝑧𝜓))

Proof of Theorem dral2-o
StepHypRef Expression
1 hbae-o 40053 . 2 (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦)
2 dral2-o.1 . 2 (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
31, 2albidh 1898 1 (∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜑 ↔ ∀𝑧𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567
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-11 2193  ax-c5 40033  ax-c4 40034  ax-c7 40035  ax-c10 40036  ax-c11 40037  ax-c9 40040
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812
This theorem is used by:  ax12eq  40091  ax12el  40092  ax12indalem  40095  ax12inda2ALT  40096
  Copyright terms: Public domain W3C validator