Theorem nfrab 3449

Description: A variable not free in a wff remains so in a restricted class abstraction. Usage of this theorem is discouraged because it depends on ax-13 2402. Use the weaker nfrabw 3448 when possible. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro, 9-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfrab.1	⊢ Ⅎ𝑥𝜑
nfrab.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nfrab	⊢ Ⅎ𝑥{𝑦 ∈ 𝐴 ∣ 𝜑}

Proof of Theorem nfrab

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rab 3414	. 2 ⊢ {𝑦 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)}
2		nftru 1837	. . . 4 ⊢ Ⅎ𝑦⊤
3		nfrab.2	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
4	3	nfcri 2915	. . . . . . 7 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
5		eleq1w 2844	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
6	4, 5	dvelimnf 2483	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥 𝑦 ∈ 𝐴)
7		nfrab.1	. . . . . . 7 ⊢ Ⅎ𝑥𝜑
8	7	a1i 11	. . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝜑)
9	6, 8	nfand 1930	. . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜑))
10	9	adantl 487	. . . 4 ⊢ ((⊤ ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜑))
11	2, 10	nfabd2 2946	. . 3 ⊢ (⊤ → Ⅎ𝑥{𝑦 ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)})
12	11	mptru 1577	. 2 ⊢ Ⅎ𝑥{𝑦 ∣ (𝑦 ∈ 𝐴 ∧ 𝜑)}
13	1, 12	nfcxfr 2921	1 ⊢ Ⅎ𝑥{𝑦 ∈ 𝐴 ∣ 𝜑}

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401  ∀wal 1568  ⊤wtru 1571  Ⅎwnf 1816   ∈ wcel 2145  {cab 2739  Ⅎwnfc 2908  {crab 3413

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-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rab 3414

This theorem is used by: (None)