ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  djudm Unicode version

Theorem djudm 6998
Description: The domain of the "domain-disjoint-union" is the disjoint union of the domains. Remark: its range is the (standard) union of the ranges. (Contributed by BJ, 10-Jul-2022.)
Assertion
Ref Expression
djudm  |-  dom  ( F ⊔d  G )  =  ( dom  F dom  G )

Proof of Theorem djudm
StepHypRef Expression
1 df-djud 6996 . . 3  |-  ( F ⊔d  G )  =  ( ( F  o.  `' (inl  |`  dom  F ) )  u.  ( G  o.  `' (inr  |`  dom  G
) ) )
21dmeqi 4748 . 2  |-  dom  ( F ⊔d  G )  =  dom  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) )
3 dmun 4754 . 2  |-  dom  (
( F  o.  `' (inl  |`  dom  F ) )  u.  ( G  o.  `' (inr  |`  dom  G
) ) )  =  ( dom  ( F  o.  `' (inl  |`  dom  F
) )  u.  dom  ( G  o.  `' (inr  |`  dom  G ) ) )
4 dmco 5055 . . . . 5  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) )  =  ( `' `' (inl  |`  dom  F )
" dom  F )
5 imacnvcnv 5011 . . . . 5  |-  ( `' `' (inl  |`  dom  F
) " dom  F
)  =  ( (inl  |`  dom  F ) " dom  F )
6 resima 4860 . . . . . 6  |-  ( (inl  |`  dom  F ) " dom  F )  =  (inl " dom  F )
7 df-ima 4560 . . . . . 6  |-  (inl " dom  F )  =  ran  (inl  |`  dom  F )
86, 7eqtri 2161 . . . . 5  |-  ( (inl  |`  dom  F ) " dom  F )  =  ran  (inl  |`  dom  F )
94, 5, 83eqtri 2165 . . . 4  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) )  =  ran  (inl  |`  dom  F
)
10 dmco 5055 . . . . 5  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) )  =  ( `' `' (inr  |`  dom  G )
" dom  G )
11 imacnvcnv 5011 . . . . 5  |-  ( `' `' (inr  |`  dom  G
) " dom  G
)  =  ( (inr  |`  dom  G ) " dom  G )
12 resima 4860 . . . . . 6  |-  ( (inr  |`  dom  G ) " dom  G )  =  (inr " dom  G )
13 df-ima 4560 . . . . . 6  |-  (inr " dom  G )  =  ran  (inr  |`  dom  G )
1412, 13eqtri 2161 . . . . 5  |-  ( (inr  |`  dom  G ) " dom  G )  =  ran  (inr  |`  dom  G )
1510, 11, 143eqtri 2165 . . . 4  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) )  =  ran  (inr  |`  dom  G
)
169, 15uneq12i 3233 . . 3  |-  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  u.  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  =  ( ran  (inl  |`  dom  F )  u.  ran  (inr  |`  dom  G
) )
17 djuunr 6959 . . 3  |-  ( ran  (inl  |`  dom  F )  u.  ran  (inr  |`  dom  G
) )  =  ( dom  F dom  G )
1816, 17eqtri 2161 . 2  |-  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  u.  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  =  ( dom 
F dom  G )
192, 3, 183eqtri 2165 1  |-  dom  ( F ⊔d  G )  =  ( dom  F dom  G )
Colors of variables: wff set class
Syntax hints:    = wceq 1332    u. cun 3074   `'ccnv 4546   dom cdm 4547   ran crn 4548    |` cres 4549   "cima 4550    o. ccom 4551   ⊔ cdju 6930  inlcinl 6938  inrcinr 6939   ⊔d cdjud 6995
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-1st 6046  df-2nd 6047  df-1o 6321  df-dju 6931  df-inl 6940  df-inr 6941  df-djud 6996
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator