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

Theorem djufun 7302
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 7259 . . . . 5  |-  (inl  |`  dom  F
) : dom  F -1-1-> ( dom  F dom  G )
3 df-f1 5331 . . . . . 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 275 . . . . 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 5366 . . . 4  |-  ( ( Fun  F  /\  Fun  `' (inl  |`  dom  F ) )  ->  Fun  ( F  o.  `' (inl  |`  dom  F
) ) )
71, 5, 6syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( F  o.  `' (inl  |`  dom  F
) ) )
8 djufun.g . . . 4  |-  ( ph  ->  Fun  G )
9 inrresf1 7260 . . . . 5  |-  (inr  |`  dom  G
) : dom  G -1-1-> ( dom  F dom  G )
10 df-f1 5331 . . . . . 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 275 . . . . 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 5366 . . . 4  |-  ( ( Fun  G  /\  Fun  `' (inr  |`  dom  G ) )  ->  Fun  ( G  o.  `' (inr  |`  dom  G
) ) )
148, 12, 13syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( G  o.  `' (inr  |`  dom  G
) ) )
15 dmcoss 5002 . . . . . . 7  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) ) 
C_  dom  `' (inl  |` 
dom  F )
16 df-rn 4736 . . . . . . 7  |-  ran  (inl  |` 
dom  F )  =  dom  `' (inl  |`  dom  F
)
1715, 16sseqtrri 3262 . . . . . 6  |-  dom  ( F  o.  `' (inl  |` 
dom  F ) ) 
C_  ran  (inl  |`  dom  F
)
18 dmcoss 5002 . . . . . . 7  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) ) 
C_  dom  `' (inr  |` 
dom  G )
19 df-rn 4736 . . . . . . 7  |-  ran  (inr  |` 
dom  G )  =  dom  `' (inr  |`  dom  G
)
2018, 19sseqtrri 3262 . . . . . 6  |-  dom  ( G  o.  `' (inr  |` 
dom  G ) ) 
C_  ran  (inr  |`  dom  G
)
21 ss2in 3435 . . . . . 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 426 . . . . 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 7261 . . . . . 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 3277 . . . 4  |-  ( ph  ->  ( dom  ( F  o.  `' (inl  |`  dom  F
) )  i^i  dom  ( G  o.  `' (inr  |`  dom  G ) ) )  C_  (/) )
26 ss0 3535 . . . 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 5371 . . 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 1272 . 2  |-  ( ph  ->  Fun  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) ) )
30 df-djud 7301 . . 3  |-  ( F ⊔d  G )  =  ( ( F  o.  `' (inl  |`  dom  F ) )  u.  ( G  o.  `' (inr  |`  dom  G
) ) )
3130funeqi 5347 . 2  |-  ( Fun  ( F ⊔d  G )  <->  Fun  ( ( F  o.  `' (inl  |`  dom  F
) )  u.  ( G  o.  `' (inr  |` 
dom  G ) ) ) )
3229, 31sylibr 134 1  |-  ( ph  ->  Fun  ( F ⊔d  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    u. cun 3198    i^i cin 3199    C_ wss 3200   (/)c0 3494   `'ccnv 4724   dom cdm 4725   ran crn 4726    |` cres 4727    o. ccom 4729   Fun wfun 5320   -->wf 5322   -1-1->wf1 5323   ⊔ cdju 7235  inlcinl 7243  inrcinr 7244   ⊔d cdjud 7300
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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-1st 6302  df-2nd 6303  df-1o 6581  df-dju 7236  df-inl 7245  df-inr 7246  df-djud 7301
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator