| 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 5680 | . . . 4 ⊢ (𝐴 = 𝐵 → ({∅} × 𝐴) = ({∅} × 𝐵)) | |
| 2 | 1 | adantr 486 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({∅} × 𝐴) = ({∅} × 𝐵)) |
| 3 | xpeq2 5680 | . . . 4 ⊢ (𝐶 = 𝐷 → ({1o} × 𝐶) = ({1o} × 𝐷)) | |
| 4 | 3 | adantl 487 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({1o} × 𝐶) = ({1o} × 𝐷)) |
| 5 | 2, 4 | uneq12d 4119 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (({∅} × 𝐴) ∪ ({1o} × 𝐶)) = (({∅} × 𝐵) ∪ ({1o} × 𝐷))) |
| 6 | df-dju 9909 | . 2 ⊢ (𝐴 ⊔ 𝐶) = (({∅} × 𝐴) ∪ ({1o} × 𝐶)) | |
| 7 | df-dju 9909 | . 2 ⊢ (𝐵 ⊔ 𝐷) = (({∅} × 𝐵) ∪ ({1o} × 𝐷)) | |
| 8 | 5, 6, 7 | 3eqtr4g 2822 | 1 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∪ cun 3900 ∅c0 4282 {csn 4587 × cxp 5657 1oc1o 8451 ⊔ cdju 9906 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-un 3907 df-opab 5172 df-xp 5665 df-dju 9909 |
| This theorem is used by: djueq1 9913 djueq2 9914 isfin5 10304 alephadd 10589 |
| Copyright terms: Public domain | W3C validator |