Theorem sbcrexgOLD 40607

Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 15-Nov-2005.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) Obsolete as of 18-Aug-2018. Use sbcrex 3808 instead. (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
sbcrexgOLD	⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

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

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem sbcrexgOLD

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfsbcq2 3719	. 2 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑))
2		dfsbcq2 3719	. . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
3	2	rexbidv 3226	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
4		nfcv 2907	. . . 4 ⊢ Ⅎ𝑥𝐵
5		nfs1v 2153	. . . 4 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
6	4, 5	nfrex 3242	. . 3 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑
7		sbequ12 2244	. . . 4 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
8	7	rexbidv 3226	. . 3 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑))
9	6, 8	sbie 2506	. 2 ⊢ ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
10	1, 3, 9	vtoclbg 3507	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539  [wsb 2067   ∈ wcel 2106  ∃wrex 3065  [wsbc 3716

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-sbc 3717

This theorem is referenced by:  2sbcrexOLD  40608  sbc2rexgOLD  40610