cbvralvw

Description: Change the bound variable of a restricted universal quantifier using implicit substitution. Version of cbvralv with a disjoint variable condition, which does not require ax-10 , ax-11 , ax-12 , ax-13 . (Contributed by NM, 28-Jan-1997) Avoid ax-13 . (Revised by GG, 10-Jan-2024)

		Ref	Expression
	Hypothesis	cbvralvw.1	$⊢ x = y \to (φ \leftrightarrow ψ)$
	Assertion	cbvralvw	$⊢ \forall x \in A φ \leftrightarrow \forall y \in A ψ$

Proof

Step	Hyp	Ref	Expression
1		cbvralvw.1	$⊢ x = y \to (φ \leftrightarrow ψ)$
2		eleq1w	$⊢ x = y \to (x \in A \leftrightarrow y \in A)$
3	2 1	imbi12d	$⊢ x = y \to ((x \in A \to φ) \leftrightarrow (y \in A \to ψ))$
4	3	cbvalvw	$⊢ \forall x (x \in A \to φ) \leftrightarrow \forall y (y \in A \to ψ)$
5		df-ral	$⊢ \forall x \in A φ \leftrightarrow \forall x (x \in A \to φ)$
6		df-ral	$⊢ \forall y \in A ψ \leftrightarrow \forall y (y \in A \to ψ)$
7	4 5 6	3bitr4i	$⊢ \forall x \in A φ \leftrightarrow \forall y \in A ψ$

Metamath Proof Explorer

Theorem cbvralvw

Proof