Theorem nfifd 4485

Description: Deduction form of nfif 4486. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 13-Oct-2016.)

Hypotheses

Ref	Expression
nfifd.2	⊢ (𝜑 → Ⅎ𝑥𝜓)
nfifd.3	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfifd.4	⊢ (𝜑 → Ⅎ𝑥𝐵)

Assertion

Ref	Expression
nfifd	⊢ (𝜑 → Ⅎ𝑥if(𝜓, 𝐴, 𝐵))

Proof of Theorem nfifd

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfif2 4458	. 2 ⊢ if(𝜓, 𝐴, 𝐵) = {𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))}
2		nfv 1918	. . 3 ⊢ Ⅎ𝑦𝜑
3		nfifd.4	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	3	nfcrd 2895	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐵)
5		nfifd.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
6	4, 5	nfimd 1898	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐵 → 𝜓))
7		nfifd.3	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐴)
8	7	nfcrd 2895	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴)
9	8, 5	nfand 1901	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓))
10	6, 9	nfimd 1898	. . 3 ⊢ (𝜑 → Ⅎ𝑥((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓)))
11	2, 10	nfabdw 2929	. 2 ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))})
12	1, 11	nfcxfrd 2905	1 ⊢ (𝜑 → Ⅎ𝑥if(𝜓, 𝐴, 𝐵))

Syntax hints:   → wi 4   ∧ wa 395  Ⅎwnf 1787   ∈ wcel 2108  {cab 2715  Ⅎwnfc 2886  ifcif 4456

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-if 4457

This theorem is referenced by:  nfif  4486  nfxnegd  42871