Theorem nfabdw 2932

Description: Bound-variable hypothesis builder for a class abstraction. Version of nfabd 2934 with a disjoint variable condition, which does not require ax-13 2380. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-13 2380. (Revised by GG, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 23-Sep-2024.)

Hypotheses

Ref	Expression
nfabdw.1	⊢ Ⅎ𝑦𝜑
nfabdw.2	⊢ (𝜑 → Ⅎ𝑥𝜓)

Assertion

Ref	Expression
nfabdw	⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓})

Distinct variable group:   𝑥,𝑦

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

Proof of Theorem nfabdw

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1913	. 2 ⊢ Ⅎ𝑧𝜑
2		df-clab 2718	. . . 4 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ [𝑧 / 𝑦]𝜓)
3		sb6 2085	. . . 4 ⊢ ([𝑧 / 𝑦]𝜓 ↔ ∀𝑦(𝑦 = 𝑧 → 𝜓))
4	2, 3	bitri 275	. . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ ∀𝑦(𝑦 = 𝑧 → 𝜓))
5		nfabdw.1	. . . 4 ⊢ Ⅎ𝑦𝜑
6		nfvd 1914	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = 𝑧)
7		nfabdw.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
8	6, 7	nfimd 1893	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 = 𝑧 → 𝜓))
9	5, 8	nfald 2332	. . 3 ⊢ (𝜑 → Ⅎ𝑥∀𝑦(𝑦 = 𝑧 → 𝜓))
10	4, 9	nfxfrd 1852	. 2 ⊢ (𝜑 → Ⅎ𝑥 𝑧 ∈ {𝑦 ∣ 𝜓})
11	1, 10	nfcd 2901	1 ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓})

Syntax hints:   → wi 4  ∀wal 1535  Ⅎwnf 1781  [wsb 2064   ∈ wcel 2108  {cab 2717  Ⅎwnfc 2893

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-10 2141  ax-11 2158  ax-12 2178

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-nfc 2895

This theorem is referenced by:  nfrabw  3483  nfrabwOLD  3484  nfsbcdw  3825  nfcsb1d  3944  nfcsbw  3948  nfifd  4577  nfunid  4937  nfopabd  5234  nfiotadw  6528  nfintd  48765  nfiund  48766