Theorem sbcrext 3110

Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 1-Mar-2008.) (Proof shortened by Mario Carneiro, 13-Oct-2016.)

Assertion

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

Distinct variable groups:   𝑥,𝑦   𝑥,𝐵

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

Proof of Theorem sbcrext

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbcex 3041	. . 3 ⊢ ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 → 𝐴 ∈ V)
2	1	a1i 9	. 2 ⊢ (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 → 𝐴 ∈ V))
3		nfnfc1 2378	. . 3 ⊢ Ⅎ𝑦Ⅎ𝑦𝐴
4		id 19	. . . 4 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦𝐴)
5		nfcvd 2376	. . . 4 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦V)
6	4, 5	nfeld 2391	. . 3 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦 𝐴 ∈ V)
7		sbcex 3041	. . . 4 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
8	7	2a1i 27	. . 3 ⊢ (Ⅎ𝑦𝐴 → (𝑦 ∈ 𝐵 → ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)))
9	3, 6, 8	rexlimd2 2649	. 2 ⊢ (Ⅎ𝑦𝐴 → (∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 → 𝐴 ∈ V))
10		sbcco 3054	. . . 4 ⊢ ([𝐴 / 𝑧][𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑)
11		simpl 109	. . . . 5 ⊢ ((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) → 𝐴 ∈ V)
12		sbsbc 3036	. . . . . . 7 ⊢ ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ [𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑)
13		nfcv 2375	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐵
14		nfs1v 1992	. . . . . . . . 9 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
15	13, 14	nfrexw 2572	. . . . . . . 8 ⊢ Ⅎ𝑥∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑
16		sbequ12 1819	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
17	16	rexbidv 2534	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑))
18	15, 17	sbie 1839	. . . . . . 7 ⊢ ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
19	12, 18	bitr3i 186	. . . . . 6 ⊢ ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
20		nfcvd 2376	. . . . . . . . . 10 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦𝑧)
21	20, 4	nfeqd 2390	. . . . . . . . 9 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦 𝑧 = 𝐴)
22	3, 21	nfan1 1613	. . . . . . . 8 ⊢ Ⅎ𝑦(Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴)
23		dfsbcq2 3035	. . . . . . . . 9 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
24	23	adantl 277	. . . . . . . 8 ⊢ ((Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴) → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
25	22, 24	rexbid 2532	. . . . . . 7 ⊢ ((Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴) → (∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
26	25	adantll 476	. . . . . 6 ⊢ (((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) ∧ 𝑧 = 𝐴) → (∃𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
27	19, 26	bitrid 192	. . . . 5 ⊢ (((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) ∧ 𝑧 = 𝐴) → ([𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
28	11, 27	sbcied 3069	. . . 4 ⊢ ((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑧][𝑧 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
29	10, 28	bitr3id 194	. . 3 ⊢ ((𝐴 ∈ V ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
30	29	expcom 116	. 2 ⊢ (Ⅎ𝑦𝐴 → (𝐴 ∈ V → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)))
31	2, 9, 30	pm5.21ndd 713	1 ⊢ (Ⅎ𝑦𝐴 → ([𝐴 / 𝑥]∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1398  [wsb 1810   ∈ wcel 2202  Ⅎwnfc 2362  ∃wrex 2512  Vcvv 2803  [wsbc 3032

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033

This theorem is referenced by:  sbcrex  3112