| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > xpun | GIF version | ||
| Description: The cross product of two unions. (Contributed by NM, 12-Aug-2004.) | 
| Ref | Expression | 
|---|---|
| xpun | ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | xpundi 4719 | . 2 ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 ∪ 𝐵) × 𝐶) ∪ ((𝐴 ∪ 𝐵) × 𝐷)) | |
| 2 | xpundir 4720 | . . 3 ⊢ ((𝐴 ∪ 𝐵) × 𝐶) = ((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) | |
| 3 | xpundir 4720 | . . 3 ⊢ ((𝐴 ∪ 𝐵) × 𝐷) = ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷)) | |
| 4 | 2, 3 | uneq12i 3315 | . 2 ⊢ (((𝐴 ∪ 𝐵) × 𝐶) ∪ ((𝐴 ∪ 𝐵) × 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))) | 
| 5 | un4 3323 | . 2 ⊢ (((𝐴 × 𝐶) ∪ (𝐵 × 𝐶)) ∪ ((𝐴 × 𝐷) ∪ (𝐵 × 𝐷))) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) | |
| 6 | 1, 4, 5 | 3eqtri 2221 | 1 ⊢ ((𝐴 ∪ 𝐵) × (𝐶 ∪ 𝐷)) = (((𝐴 × 𝐶) ∪ (𝐴 × 𝐷)) ∪ ((𝐵 × 𝐶) ∪ (𝐵 × 𝐷))) | 
| Colors of variables: wff set class | 
| Syntax hints: = wceq 1364 ∪ cun 3155 × cxp 4661 | 
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 | 
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-v 2765 df-un 3161 df-opab 4095 df-xp 4669 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |