Theorem cbvrexsvw 3301

Description: Change bound variable by using a substitution. Version of cbvrexsv 3351 with a disjoint variable condition, which does not require ax-13 2377. (Contributed by NM, 2-Mar-2008.) Avoid ax-13 2377. (Revised by GG, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 8-Mar-2025.)

Assertion

Ref	Expression
cbvrexsvw	⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 [𝑦 / 𝑥]𝜑)

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

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem cbvrexsvw

Step	Hyp	Ref	Expression
1		nfv 1914	. 2 ⊢ Ⅎ𝑦𝜑
2		nfs1v 2157	. 2 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
3		sbequ12 2252	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
4	1, 2, 3	cbvrexw 3291	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 [𝑦 / 𝑥]𝜑)

Syntax hints:   ↔ wb 206  [wsb 2065  ∃wrex 3061

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-10 2142  ax-11 2158  ax-12 2178

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1780  df-nf 1784  df-sb 2066  df-clel 2810  df-nfc 2886  df-ral 3053  df-rex 3062

This theorem is referenced by:  rspesbca  3861  ac6sf  10508  ac6gf  37761