Theorem raleqd 45977

Description: Equality deduction for restricted universal quantifier. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
raleqd.a	⊢ Ⅎ𝑥𝐴
raleqd.b	⊢ Ⅎ𝑥𝐵
raleqd.e	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
raleqd	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))

Proof of Theorem raleqd

Step	Hyp	Ref	Expression
1		raleqd.e	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
2		raleqd.a	. . 3 ⊢ Ⅎ𝑥𝐴
3		raleqd.b	. . 3 ⊢ Ⅎ𝑥𝐵
4	2, 3	raleqf 3343	. 2 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))
5	1, 4	syl 18	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  Ⅎwnfc 2909  ∀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  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079

This theorem is used by:  allbutfiinf  46256