Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfifd | Structured version Visualization version GIF version |
Description: Deduction version of nfif 4115. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 13-Oct-2016.) |
Ref | Expression |
---|---|
nfifd.2 | ⊢ (𝜑 → Ⅎ𝑥𝜓) |
nfifd.3 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
nfifd.4 | ⊢ (𝜑 → Ⅎ𝑥𝐵) |
Ref | Expression |
---|---|
nfifd | ⊢ (𝜑 → Ⅎ𝑥if(𝜓, 𝐴, 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfif2 4088 | . 2 ⊢ if(𝜓, 𝐴, 𝐵) = {𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))} | |
2 | nfv 1843 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
3 | nfifd.4 | . . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
4 | 3 | nfcrd 2771 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐵) |
5 | nfifd.2 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓) | |
6 | 4, 5 | nfimd 1823 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐵 → 𝜓)) |
7 | nfifd.3 | . . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
8 | 7 | nfcrd 2771 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
9 | 8, 5 | nfand 1826 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓)) |
10 | 6, 9 | nfimd 1823 | . . 3 ⊢ (𝜑 → Ⅎ𝑥((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))) |
11 | 2, 10 | nfabd 2785 | . 2 ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ ((𝑦 ∈ 𝐵 → 𝜓) → (𝑦 ∈ 𝐴 ∧ 𝜓))}) |
12 | 1, 11 | nfcxfrd 2763 | 1 ⊢ (𝜑 → Ⅎ𝑥if(𝜓, 𝐴, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 Ⅎwnf 1708 ∈ wcel 1990 {cab 2608 Ⅎwnfc 2751 ifcif 4086 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-if 4087 |
This theorem is referenced by: nfif 4115 nfxnegd 39668 |
Copyright terms: Public domain | W3C validator |