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

Theorem ra4v 3485
Description: Version of ra4 3486 with a dv condition, requiring fewer axioms. This is stdpc5v 1852 for a restricted domain. (Contributed by BJ, 27-Mar-2020.)
Assertion
Ref Expression
ra4v (∀𝑥𝐴 (𝜑𝜓) → (𝜑 → ∀𝑥𝐴 𝜓))
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem ra4v
StepHypRef Expression
1 r19.21v 2938 . 2 (∀𝑥𝐴 (𝜑𝜓) ↔ (𝜑 → ∀𝑥𝐴 𝜓))
21biimpi 204 1 (∀𝑥𝐴 (𝜑𝜓) → (𝜑 → ∀𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wral 2891
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825
This theorem depends on definitions:  df-bi 195  df-ex 1695  df-ral 2896
This theorem is referenced by:  wfr3g  7273  frr3g  30825
  Copyright terms: Public domain W3C validator