Theorem raleqtrdv 3299

Description: Substitution of equal classes into a restricted universal quantifier. (Contributed by Matthew House, 21-Jul-2025.)

Hypotheses

Ref	Expression
raleqtrdv.1	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)
raleqtrdv.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
raleqtrdv	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

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

Proof of Theorem raleqtrdv

Step	Hyp	Ref	Expression
1		raleqtrdv.1	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)
2		raleqtrdv.2	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
3	2	raleqdv 3297	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥 ∈ 𝐵 𝜓))
4	1, 3	mpbid 232	1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)

Syntax hints:   → wi 4   = wceq 1542  ∀wral 3052

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-cleq 2729  df-ral 3053  df-rex 3062

This theorem is referenced by:  subgpgp  19530  znf1o  21510  perfopn  23133  ordtt1  23327  tx1stc  23598  xkococnlem  23607  dgrlem  26194  dchrisum0flb  27481  wlknewwlksn  29943  gsummoncoe1fz  33660  sigaclcu3  34260  subfacp1lem3  35357  poimirlem1  37793