Theorem nfifd 4497

Description: Deduction form of nfif 4498. (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 4471	. 2 ⊢ if(𝜓, 𝐴, 𝐵) = {𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))}
2		nfv 1915	. . 3 ⊢ Ⅎ𝑦𝜑
3		nfifd.4	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	3	nfcrd 2971	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐵)
5		nfifd.2	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓)
6	4, 5	nfimd 1895	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐵 → 𝜓))
7		nfifd.3	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐴)
8	7	nfcrd 2971	. . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴)
9	8, 5	nfand 1898	. . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓))
10	6, 9	nfimd 1895	. . 3 ⊢ (𝜑 → Ⅎ𝑥((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓)))
11	2, 10	nfabdw 3002	. 2 ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))})
12	1, 11	nfcxfrd 2978	1 ⊢ (𝜑 → Ⅎ𝑥if(𝜓, 𝐴, 𝐵))

Syntax hints:   → wi 4   ∧ wa 398  Ⅎwnf 1784   ∈ wcel 2114  {cab 2801  Ⅎwnfc 2963  ifcif 4469

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-if 4470

This theorem is referenced by:  nfif  4498  nfxnegd  41722