Theorem nfabdw 2943

Description: Bound-variable hypothesis builder for a class abstraction. Version of nfabd 2944 with a disjoint variable condition, which does not require ax-13 2401. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-13 2401. (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 1947	. 2 ⊢ Ⅎ𝑧𝜑
2		df-clab 2739	. . . 4 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ [𝑧 / 𝑦]𝜓)
3		sb6 2122	. . . 4 ⊢ ([𝑧 / 𝑦]𝜓 ↔ ∀𝑦(𝑦 = 𝑧 → 𝜓))
4	2, 3	bitri 278	. . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ ∀𝑦(𝑦 = 𝑧 → 𝜓))
5		nfabdw.1	. . . 4 ⊢ Ⅎ𝑦𝜑
6		nfvd 1948	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 = 𝑧)
7		nfabdw.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
8	6, 7	nfimd 1927	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 = 𝑧 → 𝜓))
9	5, 8	nfald 2358	. . 3 ⊢ (𝜑 → Ⅎ𝑥∀𝑦(𝑦 = 𝑧 → 𝜓))
10	4, 9	nfxfrd 1887	. 2 ⊢ (𝜑 → Ⅎ𝑥 𝑧 ∈ {𝑦 ∣ 𝜓})
11	1, 10	nfcd 2915	1 ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓})

This proof depends on syntax axioms:   → wi 4  ∀wal 1568  Ⅎwnf 1816  [wsb 2099   ∈ wcel 2145  {cab 2738  Ⅎwnfc 2907

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-10 2178  ax-11 2194  ax-12 2213

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-nfc 2909

This theorem is used by:  nfsbcdw  3760  nfcsb1d  3869  nfcsbw  3873  nfifd  4512  nfunid  4873  nfopabd  5173  nfiotadw  6492  nfchnd  18700  nfintd  50600  nfiund  50601