Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > difjust | GIF version |
Description: Soundness justification theorem for df-dif 3073. (Contributed by Rodolfo Medina, 27-Apr-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
difjust | ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2202 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)) | |
2 | eleq1 2202 | . . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵)) | |
3 | 2 | notbid 656 | . . . 4 ⊢ (𝑥 = 𝑧 → (¬ 𝑥 ∈ 𝐵 ↔ ¬ 𝑧 ∈ 𝐵)) |
4 | 1, 3 | anbi12d 464 | . . 3 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵))) |
5 | 4 | cbvabv 2264 | . 2 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑧 ∣ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵)} |
6 | eleq1 2202 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
7 | eleq1 2202 | . . . . 5 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵)) | |
8 | 7 | notbid 656 | . . . 4 ⊢ (𝑧 = 𝑦 → (¬ 𝑧 ∈ 𝐵 ↔ ¬ 𝑦 ∈ 𝐵)) |
9 | 6, 8 | anbi12d 464 | . . 3 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))) |
10 | 9 | cbvabv 2264 | . 2 ⊢ {𝑧 ∣ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)} |
11 | 5, 10 | eqtri 2160 | 1 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)} |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ∧ wa 103 = wceq 1331 ∈ wcel 1480 {cab 2125 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |