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

Theorem casef 7347
Description: The "case" construction of two functions is a function on the disjoint union of their domains. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
casef.f  |-  ( ph  ->  F : A --> X )
casef.g  |-  ( ph  ->  G : B --> X )
Assertion
Ref Expression
casef  |-  ( ph  -> case ( F ,  G
) : ( A B ) --> X )

Proof of Theorem casef
StepHypRef Expression
1 casef.f . . . . 5  |-  ( ph  ->  F : A --> X )
2 ffun 5492 . . . . 5  |-  ( F : A --> X  ->  Fun  F )
31, 2syl 14 . . . 4  |-  ( ph  ->  Fun  F )
4 casef.g . . . . 5  |-  ( ph  ->  G : B --> X )
5 ffun 5492 . . . . 5  |-  ( G : B --> X  ->  Fun  G )
64, 5syl 14 . . . 4  |-  ( ph  ->  Fun  G )
73, 6casefun 7344 . . 3  |-  ( ph  ->  Fun case ( F ,  G ) )
8 caserel 7346 . . . 4  |- case ( F ,  G )  C_  ( ( dom  F dom 
G )  X.  ( ran  F  u.  ran  G
) )
9 ssid 3248 . . . . 5  |-  ( dom 
F dom  G )  C_  ( dom  F dom  G )
10 frn 5498 . . . . . . 7  |-  ( F : A --> X  ->  ran  F  C_  X )
111, 10syl 14 . . . . . 6  |-  ( ph  ->  ran  F  C_  X
)
12 frn 5498 . . . . . . 7  |-  ( G : B --> X  ->  ran  G  C_  X )
134, 12syl 14 . . . . . 6  |-  ( ph  ->  ran  G  C_  X
)
1411, 13unssd 3385 . . . . 5  |-  ( ph  ->  ( ran  F  u.  ran  G )  C_  X
)
15 xpss12 4839 . . . . 5  |-  ( ( ( dom  F dom  G
)  C_  ( dom  F dom  G )  /\  ( ran  F  u.  ran  G
)  C_  X )  ->  ( ( dom  F dom 
G )  X.  ( ran  F  u.  ran  G
) )  C_  (
( dom  F dom  G
)  X.  X ) )
169, 14, 15sylancr 414 . . . 4  |-  ( ph  ->  ( ( dom  F dom 
G )  X.  ( ran  F  u.  ran  G
) )  C_  (
( dom  F dom  G
)  X.  X ) )
178, 16sstrid 3239 . . 3  |-  ( ph  -> case ( F ,  G
)  C_  ( ( dom  F dom  G )  X.  X ) )
18 funssxp 5512 . . . 4  |-  ( ( Fun case ( F ,  G )  /\ case ( F ,  G )  C_  ( ( dom  F dom 
G )  X.  X
) )  <->  (case ( F ,  G ) : dom case ( F ,  G ) --> X  /\  dom case ( F ,  G
)  C_  ( dom  F dom  G ) ) )
1918simplbi 274 . . 3  |-  ( ( Fun case ( F ,  G )  /\ case ( F ,  G )  C_  ( ( dom  F dom 
G )  X.  X
) )  -> case ( F ,  G ) : dom case ( F ,  G ) --> X )
207, 17, 19syl2anc 411 . 2  |-  ( ph  -> case ( F ,  G
) : dom case ( F ,  G ) --> X )
21 casedm 7345 . . . 4  |-  dom case ( F ,  G )  =  ( dom  F dom 
G )
22 fdm 5495 . . . . . 6  |-  ( F : A --> X  ->  dom  F  =  A )
231, 22syl 14 . . . . 5  |-  ( ph  ->  dom  F  =  A )
24 fdm 5495 . . . . . 6  |-  ( G : B --> X  ->  dom  G  =  B )
254, 24syl 14 . . . . 5  |-  ( ph  ->  dom  G  =  B )
26 djueq12 7298 . . . . 5  |-  ( ( dom  F  =  A  /\  dom  G  =  B )  ->  ( dom  F dom  G )  =  ( A B )
)
2723, 25, 26syl2anc 411 . . . 4  |-  ( ph  ->  ( dom  F dom  G
)  =  ( A B ) )
2821, 27eqtrid 2276 . . 3  |-  ( ph  ->  dom case ( F ,  G )  =  ( A B ) )
2928feq2d 5477 . 2  |-  ( ph  ->  (case ( F ,  G ) : dom case ( F ,  G ) --> X  <-> case ( F ,  G
) : ( A B ) --> X ) )
3020, 29mpbid 147 1  |-  ( ph  -> case ( F ,  G
) : ( A B ) --> X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    u. cun 3199    C_ wss 3201    X. cxp 4729   dom cdm 4731   ran crn 4732   Fun wfun 5327   -->wf 5329   ⊔ cdju 7296  casecdjucase 7342
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313  df-1o 6625  df-dju 7297  df-inl 7306  df-inr 7307  df-case 7343
This theorem is referenced by:  casef1  7349  omp1eomlem  7353  ctm  7368
  Copyright terms: Public domain W3C validator