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

Theorem casefun 7376
Description: The "case" construction of two functions is a function. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
casefun.f  |-  ( ph  ->  Fun  F )
casefun.g  |-  ( ph  ->  Fun  G )
Assertion
Ref Expression
casefun  |-  ( ph  ->  Fun case ( F ,  G ) )

Proof of Theorem casefun
StepHypRef Expression
1 casefun.f . . . 4  |-  ( ph  ->  Fun  F )
2 djulf1o 7349 . . . . . 6  |- inl : _V -1-1-onto-> ( { (/) }  X.  _V )
3 f1of1 5613 . . . . . 6  |-  (inl : _V
-1-1-onto-> ( { (/) }  X.  _V )  -> inl : _V -1-1-> ( {
(/) }  X.  _V )
)
42, 3ax-mp 5 . . . . 5  |- inl : _V -1-1-> ( { (/) }  X.  _V )
5 df-f1 5357 . . . . . 6  |-  (inl : _V
-1-1-> ( { (/) }  X.  _V )  <->  (inl : _V --> ( {
(/) }  X.  _V )  /\  Fun  `'inl ) )
65simprbi 275 . . . . 5  |-  (inl : _V
-1-1-> ( { (/) }  X.  _V )  ->  Fun  `'inl )
74, 6mp1i 10 . . . 4  |-  ( ph  ->  Fun  `'inl )
8 funco 5392 . . . 4  |-  ( ( Fun  F  /\  Fun  `'inl )  ->  Fun  ( F  o.  `'inl ) )
91, 7, 8syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( F  o.  `'inl ) )
10 casefun.g . . . 4  |-  ( ph  ->  Fun  G )
11 djurf1o 7350 . . . . . 6  |- inr : _V -1-1-onto-> ( { 1o }  X.  _V )
12 f1of1 5613 . . . . . 6  |-  (inr : _V
-1-1-onto-> ( { 1o }  X.  _V )  -> inr : _V -1-1-> ( { 1o }  X.  _V ) )
1311, 12ax-mp 5 . . . . 5  |- inr : _V -1-1-> ( { 1o }  X.  _V )
14 df-f1 5357 . . . . . 6  |-  (inr : _V
-1-1-> ( { 1o }  X.  _V )  <->  (inr : _V
--> ( { 1o }  X.  _V )  /\  Fun  `'inr ) )
1514simprbi 275 . . . . 5  |-  (inr : _V
-1-1-> ( { 1o }  X.  _V )  ->  Fun  `'inr )
1613, 15mp1i 10 . . . 4  |-  ( ph  ->  Fun  `'inr )
17 funco 5392 . . . 4  |-  ( ( Fun  G  /\  Fun  `'inr )  ->  Fun  ( G  o.  `'inr ) )
1810, 16, 17syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( G  o.  `'inr ) )
19 dmcoss 5027 . . . . . . 7  |-  dom  ( F  o.  `'inl )  C_ 
dom  `'inl
20 df-rn 4760 . . . . . . 7  |-  ran inl  =  dom  `'inl
2119, 20sseqtrri 3273 . . . . . 6  |-  dom  ( F  o.  `'inl )  C_ 
ran inl
22 dmcoss 5027 . . . . . . 7  |-  dom  ( G  o.  `'inr )  C_ 
dom  `'inr
23 df-rn 4760 . . . . . . 7  |-  ran inr  =  dom  `'inr
2422, 23sseqtrri 3273 . . . . . 6  |-  dom  ( G  o.  `'inr )  C_ 
ran inr
25 ss2in 3449 . . . . . 6  |-  ( ( dom  ( F  o.  `'inl )  C_  ran inl  /\  dom  ( G  o.  `'inr )  C_  ran inr )  ->  ( dom  ( F  o.  `'inl )  i^i  dom  ( G  o.  `'inr )
)  C_  ( ran inl  i^i 
ran inr ) )
2621, 24, 25mp2an 426 . . . . 5  |-  ( dom  ( F  o.  `'inl )  i^i  dom  ( G  o.  `'inr ) )  C_  ( ran inl  i^i  ran inr )
27 rnresv 5222 . . . . . . . . 9  |-  ran  (inl  |` 
_V )  =  ran inl
2827eqcomi 2236 . . . . . . . 8  |-  ran inl  =  ran  (inl  |`  _V )
29 rnresv 5222 . . . . . . . . 9  |-  ran  (inr  |` 
_V )  =  ran inr
3029eqcomi 2236 . . . . . . . 8  |-  ran inr  =  ran  (inr  |`  _V )
3128, 30ineq12i 3420 . . . . . . 7  |-  ( ran inl  i^i  ran inr )  =  ( ran  (inl  |`  _V )  i^i  ran  (inr  |`  _V )
)
32 djuinr 7354 . . . . . . 7  |-  ( ran  (inl  |`  _V )  i^i 
ran  (inr  |`  _V )
)  =  (/)
3331, 32eqtri 2253 . . . . . 6  |-  ( ran inl  i^i  ran inr )  =  (/)
3433a1i 9 . . . . 5  |-  ( ph  ->  ( ran inl  i^i  ran inr )  =  (/) )
3526, 34sseqtrid 3288 . . . 4  |-  ( ph  ->  ( dom  ( F  o.  `'inl )  i^i 
dom  ( G  o.  `'inr ) )  C_  (/) )
36 ss0 3549 . . . 4  |-  ( ( dom  ( F  o.  `'inl )  i^i  dom  ( G  o.  `'inr )
)  C_  (/)  ->  ( dom  ( F  o.  `'inl )  i^i  dom  ( G  o.  `'inr ) )  =  (/) )
3735, 36syl 14 . . 3  |-  ( ph  ->  ( dom  ( F  o.  `'inl )  i^i 
dom  ( G  o.  `'inr ) )  =  (/) )
38 funun 5397 . . 3  |-  ( ( ( Fun  ( F  o.  `'inl )  /\  Fun  ( G  o.  `'inr ) )  /\  ( dom  ( F  o.  `'inl )  i^i  dom  ( G  o.  `'inr ) )  =  (/) )  ->  Fun  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr ) ) )
399, 18, 37, 38syl21anc 1273 . 2  |-  ( ph  ->  Fun  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr ) ) )
40 df-case 7375 . . 3  |- case ( F ,  G )  =  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr )
)
4140funeqi 5373 . 2  |-  ( Fun case
( F ,  G
)  <->  Fun  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr ) ) )
4239, 41sylibr 134 1  |-  ( ph  ->  Fun case ( F ,  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   _Vcvv 2813    u. cun 3209    i^i cin 3210    C_ wss 3211   (/)c0 3508   {csn 3689    X. cxp 4747   `'ccnv 4748   dom cdm 4749   ran crn 4750    |` cres 4751    o. ccom 4753   Fun wfun 5346   -->wf 5348   -1-1->wf1 5349   -1-1-onto->wf1o 5351   1oc1o 6640  inlcinl 7336  inrcinr 7337  casecdjucase 7374
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1st 6334  df-2nd 6335  df-1o 6647  df-inl 7338  df-inr 7339  df-case 7375
This theorem is referenced by:  casef  7379
  Copyright terms: Public domain W3C validator