Theorem sbcrexgOLD 38313

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 3731 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 3655	. 2 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑))
2		dfsbcq2 3655	. . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
3	2	rexbidv 3237	. 2 ⊢ (𝑧 = 𝐴 → (∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
4		nfcv 2934	. . . 4 ⊢ Ⅎ𝑥𝐵
5		nfs1v 2254	. . . 4 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
6	4, 5	nfrex 3188	. . 3 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑
7		sbequ12 2229	. . . 4 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
8	7	rexbidv 3237	. . 3 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑))
9	6, 8	sbie 2484	. 2 ⊢ ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
10	1, 3, 9	vtoclbg 3468	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

Syntax hints:   → wi 4   ↔ wb 198   = wceq 1601  [wsb 2011   ∈ wcel 2107  ∃wrex 3091  [wsbc 3652

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ral 3095  df-rex 3096  df-v 3400  df-sbc 3653

This theorem is referenced by:  2sbcrexOLD  38314  sbc2rexgOLD  38316