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

Theorem casefun 7189
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 7162 . . . . . 6  |- inl : _V -1-1-onto-> ( { (/) }  X.  _V )
3 f1of1 5523 . . . . . 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 5277 . . . . . 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 5312 . . . 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 7163 . . . . . 6  |- inr : _V -1-1-onto-> ( { 1o }  X.  _V )
12 f1of1 5523 . . . . . 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 5277 . . . . . 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 5312 . . . 4  |-  ( ( Fun  G  /\  Fun  `'inr )  ->  Fun  ( G  o.  `'inr ) )
1810, 16, 17syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( G  o.  `'inr ) )
19 dmcoss 4949 . . . . . . 7  |-  dom  ( F  o.  `'inl )  C_ 
dom  `'inl
20 df-rn 4687 . . . . . . 7  |-  ran inl  =  dom  `'inl
2119, 20sseqtrri 3228 . . . . . 6  |-  dom  ( F  o.  `'inl )  C_ 
ran inl
22 dmcoss 4949 . . . . . . 7  |-  dom  ( G  o.  `'inr )  C_ 
dom  `'inr
23 df-rn 4687 . . . . . . 7  |-  ran inr  =  dom  `'inr
2422, 23sseqtrri 3228 . . . . . 6  |-  dom  ( G  o.  `'inr )  C_ 
ran inr
25 ss2in 3401 . . . . . 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 5143 . . . . . . . . 9  |-  ran  (inl  |` 
_V )  =  ran inl
2827eqcomi 2209 . . . . . . . 8  |-  ran inl  =  ran  (inl  |`  _V )
29 rnresv 5143 . . . . . . . . 9  |-  ran  (inr  |` 
_V )  =  ran inr
3029eqcomi 2209 . . . . . . . 8  |-  ran inr  =  ran  (inr  |`  _V )
3128, 30ineq12i 3372 . . . . . . 7  |-  ( ran inl  i^i  ran inr )  =  ( ran  (inl  |`  _V )  i^i  ran  (inr  |`  _V )
)
32 djuinr 7167 . . . . . . 7  |-  ( ran  (inl  |`  _V )  i^i 
ran  (inr  |`  _V )
)  =  (/)
3331, 32eqtri 2226 . . . . . 6  |-  ( ran inl  i^i  ran inr )  =  (/)
3433a1i 9 . . . . 5  |-  ( ph  ->  ( ran inl  i^i  ran inr )  =  (/) )
3526, 34sseqtrid 3243 . . . 4  |-  ( ph  ->  ( dom  ( F  o.  `'inl )  i^i 
dom  ( G  o.  `'inr ) )  C_  (/) )
36 ss0 3501 . . . 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 5316 . . 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 1249 . 2  |-  ( ph  ->  Fun  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr ) ) )
40 df-case 7188 . . 3  |- case ( F ,  G )  =  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr )
)
4140funeqi 5293 . 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 1373   _Vcvv 2772    u. cun 3164    i^i cin 3165    C_ wss 3166   (/)c0 3460   {csn 3633    X. cxp 4674   `'ccnv 4675   dom cdm 4676   ran crn 4677    |` cres 4678    o. ccom 4680   Fun wfun 5266   -->wf 5268   -1-1->wf1 5269   -1-1-onto->wf1o 5271   1oc1o 6497  inlcinl 7149  inrcinr 7150  casecdjucase 7187
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-nul 4171  ax-pow 4219  ax-pr 4254  ax-un 4481
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-id 4341  df-iord 4414  df-on 4416  df-suc 4419  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-f1 5277  df-fo 5278  df-f1o 5279  df-fv 5280  df-1st 6228  df-2nd 6229  df-1o 6504  df-inl 7151  df-inr 7152  df-case 7188
This theorem is referenced by:  casef  7192
  Copyright terms: Public domain W3C validator