Metamath Proof Explorer


Theorem ralbid

Description: Formula-building rule for restricted universal quantifier (deduction form). For a version based on fewer axioms see ralbidv . (Contributed by NM, 27-Jun-1998)

Ref Expression
Hypotheses ralbid.1 ⊢ Ⅎ 𝑥 𝜑
ralbid.2 ⊢ ( 𝜑 → ( 𝜓 ↔ 𝜒 ) )
Assertion ralbid ( 𝜑 → ( ∀ 𝑥 ∈ 𝐴 𝜓 ↔ ∀ 𝑥 ∈ 𝐴 𝜒 ) )

Proof

Step Hyp Ref Expression
1 ralbid.1 ⊢ Ⅎ 𝑥 𝜑
2 ralbid.2 ⊢ ( 𝜑 → ( 𝜓 ↔ 𝜒 ) )
3 2 adantr ⊢ ( ( 𝜑 ∧ 𝑥 ∈ 𝐴 ) → ( 𝜓 ↔ 𝜒 ) )
4 1 3 ralbida ⊢ ( 𝜑 → ( ∀ 𝑥 ∈ 𝐴 𝜓 ↔ ∀ 𝑥 ∈ 𝐴 𝜒 ) )