![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfdif | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for class difference. (Contributed by NM, 3-Dec-2003.) (Revised by Mario Carneiro, 13-Oct-2016.) |
Ref | Expression |
---|---|
nfdif.1 | ⊢ Ⅎ𝑥𝐴 |
nfdif.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nfdif | ⊢ Ⅎ𝑥(𝐴 ∖ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfdif2 3890 | . 2 ⊢ (𝐴 ∖ 𝐵) = {𝑦 ∈ 𝐴 ∣ ¬ 𝑦 ∈ 𝐵} | |
2 | nfdif.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
3 | 2 | nfcri 2943 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵 |
4 | 3 | nfn 1858 | . . 3 ⊢ Ⅎ𝑥 ¬ 𝑦 ∈ 𝐵 |
5 | nfdif.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
6 | 4, 5 | nfrabw 3338 | . 2 ⊢ Ⅎ𝑥{𝑦 ∈ 𝐴 ∣ ¬ 𝑦 ∈ 𝐵} |
7 | 1, 6 | nfcxfr 2953 | 1 ⊢ Ⅎ𝑥(𝐴 ∖ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2111 Ⅎwnfc 2936 {crab 3110 ∖ cdif 3878 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-rab 3115 df-dif 3884 |
This theorem is referenced by: nfsymdif 4173 iunxdif3 4980 boxcutc 8488 nfsup 8899 gsum2d2lem 19086 iunconn 22033 iundisj 24152 iundisj2 24153 limciun 24497 difrab2 30268 iundisjf 30352 iundisj2f 30353 suppss2f 30398 aciunf1 30426 iundisjfi 30545 iundisj2fi 30546 fedgmullem2 31114 sigapildsys 31531 csbdif 34742 vvdifopab 35681 compab 41146 iunconnlem2 41641 supminfxr2 42108 stoweidlem28 42670 stoweidlem34 42676 stoweidlem46 42688 stoweidlem53 42695 stoweidlem55 42697 stoweidlem59 42701 stirlinglem5 42720 preimagelt 43337 preimalegt 43338 |
Copyright terms: Public domain | W3C validator |