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

Theorem djufun 7081
Description: The "domain-disjoint-union" of two functions is a function. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
djufun.f  |-  ( ph  ->  Fun  F )
djufun.g  |-  ( ph  ->  Fun  G )
Assertion
Ref Expression
djufun  |-  ( ph  ->  Fun  ( F ⊔d  G ) )

Proof of Theorem djufun
StepHypRef Expression
1 djufun.f . . . 4  |-  ( ph  ->  Fun  F )
2 inlresf1 7038 . . . . 5  |-  (inl  |`  dom  F
) : dom  F -1-1-> ( dom  F dom  G )
3 df-f1 5203 . . . . . 6  |-  ( (inl  |`  dom  F ) : dom  F -1-1-> ( dom 
F dom  G )  <->  ( (inl  |` 
dom  F ) : dom  F --> ( dom 
F dom  G )  /\  Fun  `' (inl  |`  dom  F
) ) )
43simprbi 273 . . . . 5  |-  ( (inl  |`  dom  F ) : dom  F -1-1-> ( dom 
F dom  G )  ->  Fun  `' (inl  |`  dom  F
) )
52, 4mp1i 10 . . . 4  |-  ( ph  ->  Fun  `' (inl  |`  dom  F
) )
6 funco 5238 . . . 4  |-  ( ( Fun  F  /\  Fun  `' (inl  |`  dom  F ) )  ->  Fun  ( F  o.  `' (inl  |`  dom  F
) ) )
71, 5, 6syl2anc 409 . . 3  |-  ( ph  ->  Fun  ( F  o.  `' (inl  |`  dom  F
) ) )
8 djufun.g . . . 4  |-  ( ph  ->  Fun  G )
9 inrresf1 7039 . . . . 5  |-  (inr  |`  dom  G
) : dom  G -1-1-> ( dom  F dom  G )
10 df-f1 5203 . . . . . 6  |-  ( (inr  |`  dom  G ) : dom  G -1-1-> ( dom 
F dom  G )  <->  ( (inr  |` 
dom  G ) : dom  G --> ( dom 
F dom  G )  /\  Fun  `' (inr  |`  dom  G
) ) )
1110simprbi 273 . . . . 5  |-  ( (inr  |`  dom  G ) : dom  G -1-1-> ( dom 
F dom  G )  ->  Fun  `' (inr  |`  dom  G
) )
129, 11mp1i 10 . . . 4  |-  ( ph  ->  Fun  `' (inr  |`  dom  G
) )
13 funco 5238 . . . 4  |-  ( ( Fun  G  /\  Fun  `' (inr  |`  dom  G ) )  ->  Fun  ( G  o.  `' (inr  |`  dom  G
) ) )
148, 12, 13syl2anc 409 . . 3  |-  ( ph  ->  Fun  ( G  o.  `' (inr  |`  dom  G
) ) )
15 dmcoss 4880 . . . . . . 7  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) ) 
C_  dom  `' (inl  |` 
dom  F )
16 df-rn 4622 . . . . . . 7  |-  ran  (inl  |` 
dom  F )  =  dom  `' (inl  |`  dom  F
)
1715, 16sseqtrri 3182 . . . . . 6  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) ) 
C_  ran  (inl  |`  dom  F
)
18 dmcoss 4880 . . . . . . 7  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) ) 
C_  dom  `' (inr  |` 
dom  G )
19 df-rn 4622 . . . . . . 7  |-  ran  (inr  |` 
dom  G )  =  dom  `' (inr  |`  dom  G
)
2018, 19sseqtrri 3182 . . . . . 6  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) ) 
C_  ran  (inr  |`  dom  G
)
21 ss2in 3355 . . . . . 6  |-  ( ( dom  ( F  o.  `' (inl  |`  dom  F
) )  C_  ran  (inl  |`  dom  F )  /\  dom  ( G  o.  `' (inr  |`  dom  G
) )  C_  ran  (inr  |`  dom  G ) )  ->  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  i^i  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  C_  ( ran  (inl  |`  dom  F )  i^i  ran  (inr  |`  dom  G
) ) )
2217, 20, 21mp2an 424 . . . . 5  |-  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  i^i  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  C_  ( ran  (inl  |`  dom  F )  i^i  ran  (inr  |`  dom  G
) )
23 djuinr 7040 . . . . . 6  |-  ( ran  (inl  |`  dom  F )  i^i  ran  (inr  |`  dom  G
) )  =  (/)
2423a1i 9 . . . . 5  |-  ( ph  ->  ( ran  (inl  |`  dom  F
)  i^i  ran  (inr  |`  dom  G
) )  =  (/) )
2522, 24sseqtrid 3197 . . . 4  |-  ( ph  ->  ( dom  ( F  o.  `' (inl  |`  dom  F
) )  i^i  dom  ( G  o.  `' (inr  |`  dom  G ) ) )  C_  (/) )
26 ss0 3455 . . . 4  |-  ( ( dom  ( F  o.  `' (inl  |`  dom  F
) )  i^i  dom  ( G  o.  `' (inr  |`  dom  G ) ) )  C_  (/)  ->  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  i^i  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  =  (/) )
2725, 26syl 14 . . 3  |-  ( ph  ->  ( dom  ( F  o.  `' (inl  |`  dom  F
) )  i^i  dom  ( G  o.  `' (inr  |`  dom  G ) ) )  =  (/) )
28 funun 5242 . . 3  |-  ( ( ( Fun  ( F  o.  `' (inl  |`  dom  F
) )  /\  Fun  ( G  o.  `' (inr  |`  dom  G ) ) )  /\  ( dom  ( F  o.  `' (inl  |`  dom  F ) )  i^i  dom  ( G  o.  `' (inr  |` 
dom  G ) ) )  =  (/) )  ->  Fun  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) ) )
297, 14, 27, 28syl21anc 1232 . 2  |-  ( ph  ->  Fun  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) ) )
30 df-djud 7080 . . 3  |-  ( F ⊔d  G )  =  ( ( F  o.  `' (inl  |`  dom  F ) )  u.  ( G  o.  `' (inr  |`  dom  G
) ) )
3130funeqi 5219 . 2  |-  ( Fun  ( F ⊔d  G )  <->  Fun  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) ) )
3229, 31sylibr 133 1  |-  ( ph  ->  Fun  ( F ⊔d  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1348    u. cun 3119    i^i cin 3120    C_ wss 3121   (/)c0 3414   `'ccnv 4610   dom cdm 4611   ran crn 4612    |` cres 4613    o. ccom 4615   Fun wfun 5192   -->wf 5194   -1-1->wf1 5195   ⊔ cdju 7014  inlcinl 7022  inrcinr 7023   ⊔d cdjud 7079
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-1st 6119  df-2nd 6120  df-1o 6395  df-dju 7015  df-inl 7024  df-inr 7025  df-djud 7080
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator