Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > difab | GIF version |
Description: Difference of two class abstractions. (Contributed by NM, 23-Oct-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
Ref | Expression |
---|---|
difab | ⊢ ({𝑥 ∣ 𝜑} ∖ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ ¬ 𝜓)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-clab 2157 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∧ ¬ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∧ ¬ 𝜓)) | |
2 | sban 1948 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∧ ¬ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥] ¬ 𝜓)) | |
3 | df-clab 2157 | . . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
4 | 3 | bicomi 131 | . . . 4 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑}) |
5 | sbn 1945 | . . . . 5 ⊢ ([𝑦 / 𝑥] ¬ 𝜓 ↔ ¬ [𝑦 / 𝑥]𝜓) | |
6 | df-clab 2157 | . . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
7 | 5, 6 | xchbinxr 678 | . . . 4 ⊢ ([𝑦 / 𝑥] ¬ 𝜓 ↔ ¬ 𝑦 ∈ {𝑥 ∣ 𝜓}) |
8 | 4, 7 | anbi12i 457 | . . 3 ⊢ (([𝑦 / 𝑥]𝜑 ∧ [𝑦 / 𝑥] ¬ 𝜓) ↔ (𝑦 ∈ {𝑥 ∣ 𝜑} ∧ ¬ 𝑦 ∈ {𝑥 ∣ 𝜓})) |
9 | 1, 2, 8 | 3bitrri 206 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∧ ¬ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∧ ¬ 𝜓)}) |
10 | 9 | difeqri 3247 | 1 ⊢ ({𝑥 ∣ 𝜑} ∖ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∧ ¬ 𝜓)} |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ∧ wa 103 = wceq 1348 [wsb 1755 ∈ wcel 2141 {cab 2156 ∖ cdif 3118 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-v 2732 df-dif 3123 |
This theorem is referenced by: notab 3397 difrab 3401 notrab 3404 imadiflem 5277 imadif 5278 |
Copyright terms: Public domain | W3C validator |