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

Theorem ra4 3490
Description: Restricted quantifier version of Axiom 5 of [Mendelson] p. 69. This is the axiom stdpc5 2062 of standard predicate calculus for a restricted domain. See ra4v 3489 for a version requiring fewer axioms. (Contributed by NM, 16-Jan-2004.) (Proof shortened by BJ, 27-Mar-2020.)
Hypothesis
Ref Expression
ra4.1 𝑥𝜑
Assertion
Ref Expression
ra4 (∀𝑥𝐴 (𝜑𝜓) → (𝜑 → ∀𝑥𝐴 𝜓))

Proof of Theorem ra4
StepHypRef Expression
1 ra4.1 . . 3 𝑥𝜑
21r19.21 2938 . 2 (∀𝑥𝐴 (𝜑𝜓) ↔ (𝜑 → ∀𝑥𝐴 𝜓))
32biimpi 204 1 (∀𝑥𝐴 (𝜑𝜓) → (𝜑 → ∀𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wnf 1698  wral 2895
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-12 2033
This theorem depends on definitions:  df-bi 195  df-ex 1695  df-nf 1700  df-ral 2900
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator