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

Theorem casefun 7213
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 7186 . . . . . 6  |- inl : _V -1-1-onto-> ( { (/) }  X.  _V )
3 f1of1 5543 . . . . . 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 5295 . . . . . 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 5330 . . . 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 7187 . . . . . 6  |- inr : _V -1-1-onto-> ( { 1o }  X.  _V )
12 f1of1 5543 . . . . . 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 5295 . . . . . 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 5330 . . . 4  |-  ( ( Fun  G  /\  Fun  `'inr )  ->  Fun  ( G  o.  `'inr ) )
1810, 16, 17syl2anc 411 . . 3  |-  ( ph  ->  Fun  ( G  o.  `'inr ) )
19 dmcoss 4967 . . . . . . 7  |-  dom  ( F  o.  `'inl )  C_ 
dom  `'inl
20 df-rn 4704 . . . . . . 7  |-  ran inl  =  dom  `'inl
2119, 20sseqtrri 3236 . . . . . 6  |-  dom  ( F  o.  `'inl )  C_ 
ran inl
22 dmcoss 4967 . . . . . . 7  |-  dom  ( G  o.  `'inr )  C_ 
dom  `'inr
23 df-rn 4704 . . . . . . 7  |-  ran inr  =  dom  `'inr
2422, 23sseqtrri 3236 . . . . . 6  |-  dom  ( G  o.  `'inr )  C_ 
ran inr
25 ss2in 3409 . . . . . 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 5161 . . . . . . . . 9  |-  ran  (inl  |` 
_V )  =  ran inl
2827eqcomi 2211 . . . . . . . 8  |-  ran inl  =  ran  (inl  |`  _V )
29 rnresv 5161 . . . . . . . . 9  |-  ran  (inr  |` 
_V )  =  ran inr
3029eqcomi 2211 . . . . . . . 8  |-  ran inr  =  ran  (inr  |`  _V )
3128, 30ineq12i 3380 . . . . . . 7  |-  ( ran inl  i^i  ran inr )  =  ( ran  (inl  |`  _V )  i^i  ran  (inr  |`  _V )
)
32 djuinr 7191 . . . . . . 7  |-  ( ran  (inl  |`  _V )  i^i 
ran  (inr  |`  _V )
)  =  (/)
3331, 32eqtri 2228 . . . . . 6  |-  ( ran inl  i^i  ran inr )  =  (/)
3433a1i 9 . . . . 5  |-  ( ph  ->  ( ran inl  i^i  ran inr )  =  (/) )
3526, 34sseqtrid 3251 . . . 4  |-  ( ph  ->  ( dom  ( F  o.  `'inl )  i^i 
dom  ( G  o.  `'inr ) )  C_  (/) )
36 ss0 3509 . . . 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 5334 . . 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 7212 . . 3  |- case ( F ,  G )  =  ( ( F  o.  `'inl )  u.  ( G  o.  `'inr )
)
4140funeqi 5311 . 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 2776    u. cun 3172    i^i cin 3173    C_ wss 3174   (/)c0 3468   {csn 3643    X. cxp 4691   `'ccnv 4692   dom cdm 4693   ran crn 4694    |` cres 4695    o. ccom 4697   Fun wfun 5284   -->wf 5286   -1-1->wf1 5287   -1-1-onto->wf1o 5289   1oc1o 6518  inlcinl 7173  inrcinr 7174  casecdjucase 7211
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-iord 4431  df-on 4433  df-suc 4436  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-1st 6249  df-2nd 6250  df-1o 6525  df-inl 7175  df-inr 7176  df-case 7212
This theorem is referenced by:  casef  7216
  Copyright terms: Public domain W3C validator