Theorem birald 1217

Description: Formula-building rule for restricted universal quantifier (deduction rule).

Hypotheses

Ref	Expression
birald.1	⊢ (φ → ∀xφ)
birald.2	⊢ (φ → (ψ ↔ χ))

Assertion

Ref	Expression
birald	⊢ (φ → (∀x ∈ A ψ ↔ ∀x ∈ A χ))

Proof of Theorem birald

Step	Hyp	Ref	Expression
1		birald.1	. 2 ⊢ (φ → ∀xφ)
2		birald.2	. . 3 ⊢ (φ → (ψ ↔ χ))
3	2	adantr 306	. 2 ⊢ ((φ ∧ x ∈ A) → (ψ ↔ χ))
4	1, 3	biralda 1213	1 ⊢ (φ → (∀x ∈ A ψ ↔ ∀x ∈ A χ))

Syntax hints:   → wi 2   ↔ wb 127  ∀wal 672   ∈ wcel 1092  ∀wral 1201

This theorem is referenced by:  biraldv 1219  biral 1223  zfrep6 2744  cplem2 3546  ac6lem 3575

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-gen 677

This theorem depends on definitions:  df-bi 128  df-an 198  df-ral 1205

metamath.org