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

Theorem caserel 7346
Description: The "case" construction of two relations is a relation, with bounds on its domain and codomain. Typically, the "case" construction is used when both relations have a common codomain. (Contributed by BJ, 10-Jul-2022.)
Assertion
Ref Expression
caserel  |- case ( R ,  S )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )

Proof of Theorem caserel
StepHypRef Expression
1 df-case 7343 . 2  |- case ( R ,  S )  =  ( ( R  o.  `'inl )  u.  ( S  o.  `'inr )
)
2 cocnvss 5269 . . . 4  |-  ( R  o.  `'inl )  C_  ( ran  (inl  |`  dom  R
)  X.  ran  ( R  |`  dom inl ) )
3 inlresf1 7320 . . . . . 6  |-  (inl  |`  dom  R
) : dom  R -1-1-> ( dom  R dom  S )
4 f1rn 5552 . . . . . 6  |-  ( (inl  |`  dom  R ) : dom  R -1-1-> ( dom 
R dom  S )  ->  ran  (inl  |`  dom  R ) 
C_  ( dom  R dom 
S ) )
53, 4ax-mp 5 . . . . 5  |-  ran  (inl  |` 
dom  R )  C_  ( dom  R dom  S )
6 resss 5043 . . . . . . 7  |-  ( R  |`  dom inl )  C_  R
7 rnss 4968 . . . . . . 7  |-  ( ( R  |`  dom inl )  C_  R  ->  ran  ( R  |` 
dom inl )  C_  ran  R
)
86, 7ax-mp 5 . . . . . 6  |-  ran  ( R  |`  dom inl )  C_  ran  R
9 ssun1 3372 . . . . . 6  |-  ran  R  C_  ( ran  R  u.  ran  S )
108, 9sstri 3237 . . . . 5  |-  ran  ( R  |`  dom inl )  C_  ( ran  R  u.  ran  S
)
11 xpss12 4839 . . . . 5  |-  ( ( ran  (inl  |`  dom  R
)  C_  ( dom  R dom  S )  /\  ran  ( R  |`  dom inl )  C_  ( ran  R  u.  ran  S ) )  -> 
( ran  (inl  |`  dom  R
)  X.  ran  ( R  |`  dom inl ) )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) ) )
125, 10, 11mp2an 426 . . . 4  |-  ( ran  (inl  |`  dom  R )  X.  ran  ( R  |`  dom inl ) )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )
132, 12sstri 3237 . . 3  |-  ( R  o.  `'inl )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )
14 cocnvss 5269 . . . 4  |-  ( S  o.  `'inr )  C_  ( ran  (inr  |`  dom  S
)  X.  ran  ( S  |`  dom inr ) )
15 inrresf1 7321 . . . . . 6  |-  (inr  |`  dom  S
) : dom  S -1-1-> ( dom  R dom  S )
16 f1rn 5552 . . . . . 6  |-  ( (inr  |`  dom  S ) : dom  S -1-1-> ( dom 
R dom  S )  ->  ran  (inr  |`  dom  S ) 
C_  ( dom  R dom 
S ) )
1715, 16ax-mp 5 . . . . 5  |-  ran  (inr  |` 
dom  S )  C_  ( dom  R dom  S )
18 resss 5043 . . . . . . 7  |-  ( S  |`  dom inr )  C_  S
19 rnss 4968 . . . . . . 7  |-  ( ( S  |`  dom inr )  C_  S  ->  ran  ( S  |` 
dom inr )  C_  ran  S
)
2018, 19ax-mp 5 . . . . . 6  |-  ran  ( S  |`  dom inr )  C_  ran  S
21 ssun2 3373 . . . . . 6  |-  ran  S  C_  ( ran  R  u.  ran  S )
2220, 21sstri 3237 . . . . 5  |-  ran  ( S  |`  dom inr )  C_  ( ran  R  u.  ran  S
)
23 xpss12 4839 . . . . 5  |-  ( ( ran  (inr  |`  dom  S
)  C_  ( dom  R dom  S )  /\  ran  ( S  |`  dom inr )  C_  ( ran  R  u.  ran  S ) )  -> 
( ran  (inr  |`  dom  S
)  X.  ran  ( S  |`  dom inr ) )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) ) )
2417, 22, 23mp2an 426 . . . 4  |-  ( ran  (inr  |`  dom  S )  X.  ran  ( S  |`  dom inr ) )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )
2514, 24sstri 3237 . . 3  |-  ( S  o.  `'inr )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )
2613, 25unssi 3384 . 2  |-  ( ( R  o.  `'inl )  u.  ( S  o.  `'inr ) )  C_  (
( dom  R dom  S
)  X.  ( ran 
R  u.  ran  S
) )
271, 26eqsstri 3260 1  |- case ( R ,  S )  C_  ( ( dom  R dom 
S )  X.  ( ran  R  u.  ran  S
) )
Colors of variables: wff set class
Syntax hints:    u. cun 3199    C_ wss 3201    X. cxp 4729   `'ccnv 4730   dom cdm 4731   ran crn 4732    |` cres 4733    o. ccom 4735   -1-1->wf1 5330   ⊔ cdju 7296  inlcinl 7304  inrcinr 7305  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-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  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-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:  casef  7347
  Copyright terms: Public domain W3C validator