![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > notrab | GIF version |
Description: Complementation of restricted class abstractions. (Contributed by Mario Carneiro, 3-Sep-2015.) |
Ref | Expression |
---|---|
notrab | ⊢ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝜑}) = {𝑥 ∈ 𝐴 ∣ ¬ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | difab 3406 | . 2 ⊢ ({𝑥 ∣ 𝑥 ∈ 𝐴} ∖ {𝑥 ∣ 𝜑}) = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)} | |
2 | difin 3374 | . . 3 ⊢ (𝐴 ∖ (𝐴 ∩ {𝑥 ∣ 𝜑})) = (𝐴 ∖ {𝑥 ∣ 𝜑}) | |
3 | dfrab3 3413 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = (𝐴 ∩ {𝑥 ∣ 𝜑}) | |
4 | 3 | difeq2i 3252 | . . 3 ⊢ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝜑}) = (𝐴 ∖ (𝐴 ∩ {𝑥 ∣ 𝜑})) |
5 | abid2 2298 | . . . 4 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 | |
6 | 5 | difeq1i 3251 | . . 3 ⊢ ({𝑥 ∣ 𝑥 ∈ 𝐴} ∖ {𝑥 ∣ 𝜑}) = (𝐴 ∖ {𝑥 ∣ 𝜑}) |
7 | 2, 4, 6 | 3eqtr4i 2208 | . 2 ⊢ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝜑}) = ({𝑥 ∣ 𝑥 ∈ 𝐴} ∖ {𝑥 ∣ 𝜑}) |
8 | df-rab 2464 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝜑)} | |
9 | 1, 7, 8 | 3eqtr4i 2208 | 1 ⊢ (𝐴 ∖ {𝑥 ∈ 𝐴 ∣ 𝜑}) = {𝑥 ∈ 𝐴 ∣ ¬ 𝜑} |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ∧ wa 104 = wceq 1353 ∈ wcel 2148 {cab 2163 {crab 2459 ∖ cdif 3128 ∩ cin 3130 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rab 2464 df-v 2741 df-dif 3133 df-in 3137 |
This theorem is referenced by: diffitest 6889 |
Copyright terms: Public domain | W3C validator |