Theorem cbvrexsv 3417

Description: Change bound variable by using a substitution. Usage of this theorem is discouraged because it depends on ax-13 2379. Use the weaker cbvrexsvw 3415 when possible. (Contributed by NM, 2-Mar-2008.) (Revised by Andrew Salmon, 11-Jul-2011.) (New usage is discouraged.)

Assertion

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

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

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem cbvrexsv

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1915	. . 3 ⊢ Ⅎ𝑧𝜑
2		nfs1v 2157	. . 3 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
3		sbequ12 2250	. . 3 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
4	1, 2, 3	cbvrex 3393	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑧 ∈ 𝐴 [𝑧 / 𝑥]𝜑)
5		nfv 1915	. . . 4 ⊢ Ⅎ𝑦𝜑
6	5	nfsb 2542	. . 3 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
7		nfv 1915	. . 3 ⊢ Ⅎ𝑧[𝑦 / 𝑥]𝜑
8		sbequ 2088	. . 3 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
9	6, 7, 8	cbvrex 3393	. 2 ⊢ (∃𝑧 ∈ 𝐴 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦 ∈ 𝐴 [𝑦 / 𝑥]𝜑)
10	4, 9	bitri 278	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐴 [𝑦 / 𝑥]𝜑)

Syntax hints:   ↔ wb 209  [wsb 2069  ∃wrex 3107

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-10 2142  ax-11 2158  ax-12 2175  ax-13 2379

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112

This theorem is referenced by:  cbvexsv  41253