Theorem ra4v 3835

Description: Version of ra4 3836 with a disjoint variable condition, requiring fewer axioms. This is stdpc5v 1971 for a restricted domain. (Contributed by BJ, 27-Mar-2020.)

Assertion

Ref	Expression
ra4v	⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓))

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem ra4v

Step	Hyp	Ref	Expression
1		r19.21v 3189	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓))
2	1	biimpi 219	1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓))

This proof depends on syntax axioms:   → wi 4  ∀wral 3078

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943

This proof depends on definitions:  df-bi 210  df-an 402  df-ral 3079

This theorem is used by:  wfr3g  8322  frr3g  9742  r1omhfb  35630  r1omhfbregs  35671