| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > djueq12 | GIF version | ||
| Description: Equality theorem for disjoint union. (Contributed by Jim Kingdon, 23-Jun-2022.) |
| Ref | Expression |
|---|---|
| djueq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpeq2 4784 | . . . 4 ⊢ (𝐴 = 𝐵 → ({∅} × 𝐴) = ({∅} × 𝐵)) | |
| 2 | 1 | adantr 276 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({∅} × 𝐴) = ({∅} × 𝐵)) |
| 3 | xpeq2 4784 | . . . 4 ⊢ (𝐶 = 𝐷 → ({1o} × 𝐶) = ({1o} × 𝐷)) | |
| 4 | 3 | adantl 277 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({1o} × 𝐶) = ({1o} × 𝐷)) |
| 5 | 2, 4 | uneq12d 3384 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (({∅} × 𝐴) ∪ ({1o} × 𝐶)) = (({∅} × 𝐵) ∪ ({1o} × 𝐷))) |
| 6 | df-dju 7368 | . 2 ⊢ (𝐴 ⊔ 𝐶) = (({∅} × 𝐴) ∪ ({1o} × 𝐶)) | |
| 7 | df-dju 7368 | . 2 ⊢ (𝐵 ⊔ 𝐷) = (({∅} × 𝐵) ∪ ({1o} × 𝐷)) | |
| 8 | 5, 6, 7 | 3eqtr4g 2296 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∪ cun 3218 ∅c0 3520 {csn 3705 × cxp 4767 1oc1o 6670 ⊔ cdju 7367 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-opab 4188 df-xp 4775 df-dju 7368 |
| This theorem is referenced by: djueq1 7370 djueq2 7371 casef 7418 |
| Copyright terms: Public domain | W3C validator |