| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > df-dju | Structured version Visualization version GIF version | ||
| Description: Disjoint union of two classes. This is a way of creating a set which contains elements corresponding to each element of 𝐴 or 𝐵, tagging each one with whether it came from 𝐴 or 𝐵. (Contributed by Jim Kingdon, 20-Jun-2022.) |
| Ref | Expression |
|---|---|
| df-dju | ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA | . . 3 class 𝐴 | |
| 2 | cB | . . 3 class 𝐵 | |
| 3 | 1, 2 | cdju 10016 | . 2 class (𝐴 ⊔ 𝐵) |
| 4 | c0 4281 | . . . . 5 class ∅ | |
| 5 | 4 | csn 4588 | . . . 4 class {∅} |
| 6 | 5, 1 | cxp 5656 | . . 3 class ({∅} × 𝐴) |
| 7 | c1o 8507 | . . . . 5 class 1o | |
| 8 | 7 | csn 4588 | . . . 4 class {1o} |
| 9 | 8, 2 | cxp 5656 | . . 3 class ({1o} × 𝐵) |
| 10 | 6, 9 | cun 4152 | . 2 class (({∅} × 𝐴) ∪ ({1o} × 𝐵)) |
| 11 | 3, 10 | wceq 1570 | 1 wff (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) |
| Colors of variables: wff setvar class |
| This definition is used by: djueq12 10022 nfdju 10025 djuex 10026 djuexb 10027 djulcl 10028 djurcl 10029 djur 10037 djuunxp 10039 eldju2ndl 10042 eldju2ndr 10043 djuun 10044 undjudom 10285 endjudisj 10286 djuen 10287 dju1dif 10290 dju1p1e2 10291 xp2dju 10294 djucomen 10295 djuassen 10296 xpdjuen 10297 mapdjuen 10298 djudom1 10300 djuxpdom 10303 djufi 10304 djuinf 10306 infdju1 10307 ficardadju 10317 pwdjudom 10332 isfin4p1 10432 alephadd 10701 canthp1lem2 10777 |
| Copyright terms: Public domain | W3C validator |