Theorem nfrexdya 2586

Description: Not-free for restricted existential quantification where 𝑦 and 𝐴 are distinct. See nfrexdxy 2584 for a version with 𝑥 and 𝑦 distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)

Hypotheses

Ref	Expression
nfraldya.2	⊢ Ⅎ𝑦𝜑
nfraldya.3	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfraldya.4	⊢ (𝜑 → Ⅎ𝑥𝜓)

Assertion

Ref	Expression
nfrexdya	⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓)

Distinct variable group:   𝑦,𝐴

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

Proof of Theorem nfrexdya

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 2534	. 2 ⊢ (∃𝑦 ∈ 𝐴 𝜓 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
2		sban 2015	. . . . . 6 ⊢ ([𝑧 / 𝑦](𝑦 ∈ 𝐴 ∧ 𝜓) ↔ ([𝑧 / 𝑦]𝑦 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓))
3		clelsb1 2343	. . . . . . 7 ⊢ ([𝑧 / 𝑦]𝑦 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)
4	3	anbi1i 462	. . . . . 6 ⊢ (([𝑧 / 𝑦]𝑦 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓))
5	2, 4	bitri 184	. . . . 5 ⊢ ([𝑧 / 𝑦](𝑦 ∈ 𝐴 ∧ 𝜓) ↔ (𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓))
6	5	exbii 1658	. . . 4 ⊢ (∃𝑧[𝑧 / 𝑦](𝑦 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓))
7		nfv 1581	. . . . 5 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐴 ∧ 𝜓)
8	7	sb8e 1910	. . . 4 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑧[𝑧 / 𝑦](𝑦 ∈ 𝐴 ∧ 𝜓))
9		df-rex 2534	. . . 4 ⊢ (∃𝑧 ∈ 𝐴 [𝑧 / 𝑦]𝜓 ↔ ∃𝑧(𝑧 ∈ 𝐴 ∧ [𝑧 / 𝑦]𝜓))
10	6, 8, 9	3bitr4i 212	. . 3 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓) ↔ ∃𝑧 ∈ 𝐴 [𝑧 / 𝑦]𝜓)
11		nfv 1581	. . . 4 ⊢ Ⅎ𝑧𝜑
12		nfraldya.3	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
13		nfraldya.2	. . . . 5 ⊢ Ⅎ𝑦𝜑
14		nfraldya.4	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
15	13, 14	nfsbd 2037	. . . 4 ⊢ (𝜑 → Ⅎ𝑥[𝑧 / 𝑦]𝜓)
16	11, 12, 15	nfrexdxy 2584	. . 3 ⊢ (𝜑 → Ⅎ𝑥∃𝑧 ∈ 𝐴 [𝑧 / 𝑦]𝜓)
17	10, 16	nfxfrd 1528	. 2 ⊢ (𝜑 → Ⅎ𝑥∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓))
18	1, 17	nfxfrd 1528	1 ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104  Ⅎwnf 1513  ∃wex 1545  [wsb 1815   ∈ wcel 2209  Ⅎwnfc 2379  ∃wrex 2529

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534

This theorem is used by:  nfrexya  2591