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

Theorem ra4v 3666
Description: Version of ra4 3667 with a dv condition, requiring fewer axioms. This is stdpc5v 2017 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 3099 . 2 (∀𝑥𝐴 (𝜑𝜓) ↔ (𝜑 → ∀𝑥𝐴 𝜓))
21biimpi 206 1 (∀𝑥𝐴 (𝜑𝜓) → (𝜑 → ∀𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wral 3051
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989
This theorem depends on definitions:  df-bi 197  df-ex 1854  df-ral 3056
This theorem is referenced by:  wfr3g  7584  frr3g  32107
  Copyright terms: Public domain W3C validator