Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > difsnb | GIF version |
Description: (𝐵 ∖ {𝐴}) equals 𝐵 if and only if 𝐴 is not a member of 𝐵. Generalization of difsn 3523. (Contributed by David Moews, 1-May-2017.) |
Ref | Expression |
---|---|
difsnb | ⊢ (¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | difsn 3523 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) = 𝐵) | |
2 | neldifsnd 3520 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 → ¬ 𝐴 ∈ (𝐵 ∖ {𝐴})) | |
3 | nelne1 2335 | . . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ (𝐵 ∖ {𝐴})) → 𝐵 ≠ (𝐵 ∖ {𝐴})) | |
4 | 2, 3 | mpdan 412 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐵 ≠ (𝐵 ∖ {𝐴})) |
5 | 4 | necomd 2331 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ∖ {𝐴}) ≠ 𝐵) |
6 | 5 | necon2bi 2300 | . 2 ⊢ ((𝐵 ∖ {𝐴}) = 𝐵 → ¬ 𝐴 ∈ 𝐵) |
7 | 1, 6 | impbii 124 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 ↔ (𝐵 ∖ {𝐴}) = 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ↔ wb 103 = wceq 1284 ∈ wcel 1433 ≠ wne 2245 ∖ cdif 2970 {csn 3398 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-v 2603 df-dif 2975 df-sn 3404 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |