| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djueq12 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for disjoint union. (Contributed by Jim Kingdon, 23-Jun-2022.) |
| Ref | Expression |
|---|---|
| djueq12 | ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpeq2 5635 | . . . 4 ⊢ (𝐴 = 𝐵 → ({∅} × 𝐴) = ({∅} × 𝐵)) | |
| 2 | 1 | adantr 480 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({∅} × 𝐴) = ({∅} × 𝐵)) |
| 3 | xpeq2 5635 | . . . 4 ⊢ (𝐶 = 𝐷 → ({1o} × 𝐶) = ({1o} × 𝐷)) | |
| 4 | 3 | adantl 481 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({1o} × 𝐶) = ({1o} × 𝐷)) |
| 5 | 2, 4 | uneq12d 4116 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (({∅} × 𝐴) ∪ ({1o} × 𝐶)) = (({∅} × 𝐵) ∪ ({1o} × 𝐷))) |
| 6 | df-dju 9794 | . 2 ⊢ (𝐴 ⊔ 𝐶) = (({∅} × 𝐴) ∪ ({1o} × 𝐶)) | |
| 7 | df-dju 9794 | . 2 ⊢ (𝐵 ⊔ 𝐷) = (({∅} × 𝐵) ∪ ({1o} × 𝐷)) | |
| 8 | 5, 6, 7 | 3eqtr4g 2791 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∪ cun 3895 ∅c0 4280 {csn 4573 × cxp 5612 1oc1o 8378 ⊔ cdju 9791 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-v 3438 df-un 3902 df-opab 5152 df-xp 5620 df-dju 9794 |
| This theorem is referenced by: djueq1 9798 djueq2 9799 isfin5 10190 alephadd 10468 |
| Copyright terms: Public domain | W3C validator |