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

Theorem ralbiOLD 3232
Description: Obsolete version of ralbi 3166 as of 17-Jun-2023. (Contributed by NM, 6-Oct-2003.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ralbiOLD (∀𝑥𝐴 (𝜑𝜓) → (∀𝑥𝐴 𝜑 ↔ ∀𝑥𝐴 𝜓))

Proof of Theorem ralbiOLD
StepHypRef Expression
1 nfra1 3218 . 2 𝑥𝑥𝐴 (𝜑𝜓)
2 rspa 3205 . 2 ((∀𝑥𝐴 (𝜑𝜓) ∧ 𝑥𝐴) → (𝜑𝜓))
31, 2ralbida 3229 1 (∀𝑥𝐴 (𝜑𝜓) → (∀𝑥𝐴 𝜑 ↔ ∀𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wral 3137
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-10 2144  ax-12 2176
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1780  df-nf 1784  df-ral 3142
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator