Theorem cbvraldva 3247

Description: Rule used to change the bound variable in a restricted universal quantifier with implicit substitution. Deduction form. (Contributed by David Moews, 1-May-2017.) Avoid ax-9 2156, ax-ext 2737. (Revised by Wolf Lammen, 9-Mar-2025.)

Hypothesis

Ref	Expression
cbvraldva.1	⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
cbvraldva	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑦 ∈ 𝐴 𝜒))

Distinct variable groups:   𝜓,𝑦   𝜒,𝑥   𝑥,𝐴,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑦)

Proof of Theorem cbvraldva

Step	Hyp	Ref	Expression
1		cbvraldva.1	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒))
2	1	ancoms 464	. . . . 5 ⊢ ((𝑥 = 𝑦 ∧ 𝜑) → (𝜓 ↔ 𝜒))
3	2	pm5.74da 816	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒)))
4	3	cbvralvw 3245	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑦 ∈ 𝐴 (𝜑 → 𝜒))
5		r19.21v 3192	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓))
6		r19.21v 3192	. . 3 ⊢ (∀𝑦 ∈ 𝐴 (𝜑 → 𝜒) ↔ (𝜑 → ∀𝑦 ∈ 𝐴 𝜒))
7	4, 5, 6	3bitr3i 304	. 2 ⊢ ((𝜑 → ∀𝑥 ∈ 𝐴 𝜓) ↔ (𝜑 → ∀𝑦 ∈ 𝐴 𝜒))
8	7	pm5.74ri 275	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑦 ∈ 𝐴 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wral 3081

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 2148

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-clel 2840  df-ral 3082

This theorem is used by:  cbvrexdva  3248  wrd2ind  14778  axtgcont  28769  cbviindavw  36808  cbvixpdavw  36823  weiunfrlem  37008