MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  djueq12 Structured version   Visualization version   GIF version

Theorem djueq12 9986
Description: Equality theorem for disjoint union. (Contributed by Jim Kingdon, 23-Jun-2022.)
Assertion
Ref Expression
djueq12 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷))

Proof of Theorem djueq12
StepHypRef Expression
1 xpeq2 5672 . . . 4 (𝐴 = 𝐵 → ({∅} × 𝐴) = ({∅} × 𝐵))
21adantr 486 . . 3 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({∅} × 𝐴) = ({∅} × 𝐵))
3 xpeq2 5672 . . . 4 (𝐶 = 𝐷 → ({1o} × 𝐶) = ({1o} × 𝐷))
43adantl 487 . . 3 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → ({1o} × 𝐶) = ({1o} × 𝐷))
52, 4uneq12d 4116 . 2 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (({∅} × 𝐴) ∪ ({1o} × 𝐶)) = (({∅} × 𝐵) ∪ ({1o} × 𝐷)))
6 df-dju 9983 . 2 (𝐴 ⊔ 𝐶) = (({∅} × 𝐴) ∪ ({1o} × 𝐶))
7 df-dju 9983 . 2 (𝐵 ⊔ 𝐷) = (({∅} × 𝐵) ∪ ({1o} × 𝐷))
85, 6, 73eqtr4g 2821 1 ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ⊔ 𝐶) = (𝐵 ⊔ 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∪ cun 3897  ∅c0 4279  {csn 4584   × cxp 5649  1oc1o 8470   ⊔ cdju 9980
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 2733
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 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-un 3902  df-opab 5168  df-xp 5657  df-dju 9983
This theorem is used by:  djueq1  9987  djueq2  9988  isfin5  10378  alephadd  10663
  Copyright terms: Public domain W3C validator