| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > unjust | GIF version | ||
| Description: Soundness justification theorem for df-un 3201. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
| Ref | Expression |
|---|---|
| unjust | ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2292 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)) | |
| 2 | eleq1 2292 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵)) | |
| 3 | 1, 2 | orbi12d 798 | . . 3 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵))) |
| 4 | 3 | cbvabv 2354 | . 2 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑧 ∣ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵)} |
| 5 | eleq1 2292 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 6 | eleq1 2292 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵)) | |
| 7 | 5, 6 | orbi12d 798 | . . 3 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵))) |
| 8 | 7 | cbvabv 2354 | . 2 ⊢ {𝑧 ∣ (𝑧 ∈ 𝐴 ∨ 𝑧 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)} |
| 9 | 4, 8 | eqtri 2250 | 1 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵)} = {𝑦 ∣ (𝑦 ∈ 𝐴 ∨ 𝑦 ∈ 𝐵)} |
| Colors of variables: wff set class |
| Syntax hints: ∨ wo 713 = wceq 1395 ∈ wcel 2200 {cab 2215 |
| 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-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |