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

Theorem casef 7434
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 5539 . . . . 5  |-  ( F : A --> X  ->  Fun  F )
31, 2syl 14 . . . 4  |-  ( ph  ->  Fun  F )
4 casef.g . . . . 5  |-  ( ph  ->  G : B --> X )
5 ffun 5539 . . . . 5  |-  ( G : B --> X  ->  Fun  G )
64, 5syl 14 . . . 4  |-  ( ph  ->  Fun  G )
73, 6casefun 7431 . . 3  |-  ( ph  ->  Fun case ( F ,  G ) )
8 caserel 7433 . . . 4  |- case ( F ,  G )  C_  ( ( dom  F ⊔  dom 
G )  X.  ( ran  F  u.  ran  G
) )
9 ssid 3268 . . . . 5  |-  ( dom 
F ⊔  dom  G )  C_  ( dom  F ⊔  dom  G )
10 frn 5545 . . . . . . 7  |-  ( F : A --> X  ->  ran  F  C_  X )
111, 10syl 14 . . . . . 6  |-  ( ph  ->  ran  F  C_  X
)
12 frn 5545 . . . . . . 7  |-  ( G : B --> X  ->  ran  G  C_  X )
134, 12syl 14 . . . . . 6  |-  ( ph  ->  ran  G  C_  X
)
1411, 13unssd 3405 . . . . 5  |-  ( ph  ->  ( ran  F  u.  ran  G )  C_  X
)
15 xpss12 4884 . . . . 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 418 . . . 4  |-  ( ph  ->  ( ( dom  F ⊔  dom 
G )  X.  ( ran  F  u.  ran  G
) )  C_  (
( dom  F ⊔  dom  G
)  X.  X ) )
178, 16sstrid 3259 . . 3  |-  ( ph  -> case ( F ,  G
)  C_  ( ( dom  F ⊔  dom  G )  X.  X ) )
18 funssxp 5560 . . . 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 415 . 2  |-  ( ph  -> case ( F ,  G
) : dom case ( F ,  G ) --> X )
21 casedm 7432 . . . 4  |-  dom case ( F ,  G )  =  ( dom  F ⊔  dom 
G )
22 fdm 5542 . . . . . 6  |-  ( F : A --> X  ->  dom  F  =  A )
231, 22syl 14 . . . . 5  |-  ( ph  ->  dom  F  =  A )
24 fdm 5542 . . . . . 6  |-  ( G : B --> X  ->  dom  G  =  B )
254, 24syl 14 . . . . 5  |-  ( ph  ->  dom  G  =  B )
26 djueq12 7385 . . . . 5  |-  ( ( dom  F  =  A  /\  dom  G  =  B )  ->  ( dom  F ⊔  dom  G )  =  ( A ⊔  B )
)
2723, 25, 26syl2anc 415 . . . 4  |-  ( ph  ->  ( dom  F ⊔  dom  G
)  =  ( A ⊔  B ) )
2821, 27eqtrid 2283 . . 3  |-  ( ph  ->  dom case ( F ,  G )  =  ( A ⊔  B ) )
2928feq2d 5524 . 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
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    u. cun 3218    C_ wss 3220    X. cxp 4774   dom cdm 4776   ran crn 4777   Fun wfun 5374   -->wf 5376   ⊔ cdju 7383  casecdjucase 7429
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-1o 6691  df-dju 7384  df-inl 7393  df-inr 7394  df-case 7430
This theorem is used by:  casef1  7436  omp1eomlem  7440  ctm  7455
  Copyright terms: Public domain W3C validator