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

Theorem albidh 1899
Description: Formula-building rule for universal quantifier (deduction form). (Contributed by NM, 26-May-1993.)
Hypotheses
Ref Expression
albidh.1 (𝜑 → ∀𝑥𝜑)
albidh.2 (𝜑 → (𝜓 ↔ 𝜒))
Assertion
Ref Expression
albidh (𝜑 → (∀𝑥𝜓 ↔ ∀𝑥𝜒))

Proof of Theorem albidh
StepHypRef Expression
1 albidh.1 . . 3 (𝜑 → ∀𝑥𝜑)
2 albidh.2 . . 3 (𝜑 → (𝜓 ↔ 𝜒))
31, 2alrimih 1857 . 2 (𝜑 → ∀𝑥(𝜓 ↔ 𝜒))
4 albi 1851 . 2 (∀𝑥(𝜓 ↔ 𝜒) → (∀𝑥𝜓 ↔ ∀𝑥𝜒))
53, 4syl 18 1 (𝜑 → (∀𝑥𝜓 ↔ ∀𝑥𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842
This proof depends on definitions:  df-bi 210
This theorem is used by:  albidv  1953  albid  2259  dral1v  2399  bj-equsalvwd  37674  dral2-o  39987  ax12indalem  40002  ax12inda2ALT  40003  ax12inda  40005
  Copyright terms: Public domain W3C validator