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

Theorem djudm 7451
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 7449 . . 3  |-  ( F ⊔d  G )  =  ( ( F  o.  `' (inl  |`  dom  F ) )  u.  ( G  o.  `' (inr  |`  dom  G
) ) )
21dmeqi 4984 . 2  |-  dom  ( F ⊔d  G )  =  dom  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) )
3 dmun 4990 . 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 5299 . . . . 5  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) )  =  ( `' `' (inl  |`  dom  F )
" dom  F )
5 imacnvcnv 5255 . . . . 5  |-  ( `' `' (inl  |`  dom  F
) " dom  F
)  =  ( (inl  |`  dom  F ) " dom  F )
6 resima 5098 . . . . . 6  |-  ( (inl  |`  dom  F ) " dom  F )  =  (inl " dom  F )
7 df-ima 4789 . . . . . 6  |-  (inl " dom  F )  =  ran  (inl  |`  dom  F )
86, 7eqtri 2259 . . . . 5  |-  ( (inl  |`  dom  F ) " dom  F )  =  ran  (inl  |`  dom  F )
94, 5, 83eqtri 2263 . . . 4  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) )  =  ran  (inl  |`  dom  F
)
10 dmco 5299 . . . . 5  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) )  =  ( `' `' (inr  |`  dom  G )
" dom  G )
11 imacnvcnv 5255 . . . . 5  |-  ( `' `' (inr  |`  dom  G
) " dom  G
)  =  ( (inr  |`  dom  G ) " dom  G )
12 resima 5098 . . . . . 6  |-  ( (inr  |`  dom  G ) " dom  G )  =  (inr " dom  G )
13 df-ima 4789 . . . . . 6  |-  (inr " dom  G )  =  ran  (inr  |`  dom  G )
1412, 13eqtri 2259 . . . . 5  |-  ( (inr  |`  dom  G ) " dom  G )  =  ran  (inr  |`  dom  G )
1510, 11, 143eqtri 2263 . . . 4  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) )  =  ran  (inr  |`  dom  G
)
169, 15uneq12i 3381 . . 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 7412 . . 3  |-  ( ran  (inl  |`  dom  F )  u.  ran  (inr  |`  dom  G
) )  =  ( dom  F ⊔  dom  G )
1816, 17eqtri 2259 . 2  |-  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  u.  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  =  ( dom 
F ⊔  dom  G )
192, 3, 183eqtri 2263 1  |-  dom  ( F ⊔d  G )  =  ( dom  F ⊔  dom  G )
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    u. cun 3218   `'ccnv 4775   dom cdm 4776   ran crn 4777    |` cres 4778   "cima 4779    o. ccom 4780   ⊔ cdju 7383  inlcinl 7391  inrcinr 7392   ⊔d cdjud 7448
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-1o 6691  df-dju 7384  df-inl 7393  df-inr 7394  df-djud 7449
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator