Theorem caserel 7417

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

Step	Hyp	Ref	Expression
1		df-case 7414	. 2 |- case ( R , S ) = ( ( R o. `'inl ) u. ( S o. `'inr ) )
2		cocnvss 5308	. . . 4 |- ( R o. `'inl ) C_ ( ran (inl |` dom R ) X. ran ( R |` dom inl ) )
3		inlresf1 7391	. . . . . 6 |- (inl |` dom R ) : dom R -1-1-> ( dom R ⊔ dom S )
4		f1rn 5594	. . . . . 6 |- ( (inl |` dom R ) : dom R -1-1-> ( dom R ⊔ dom S ) -> ran (inl |` dom R ) C_ ( dom R ⊔ dom S ) )
5	3, 4	ax-mp 5	. . . . 5 |- ran (inl |` dom R ) C_ ( dom R ⊔ dom S )
6		resss 5082	. . . . . . 7 |- ( R |` dom inl ) C_ R
7		rnss 5007	. . . . . . 7 |- ( ( R |` dom inl ) C_ R -> ran ( R |` dom inl ) C_ ran R )
8	6, 7	ax-mp 5	. . . . . 6 |- ran ( R |` dom inl ) C_ ran R
9		ssun1 3392	. . . . . 6 |- ran R C_ ( ran R u. ran S )
10	8, 9	sstri 3257	. . . . 5 |- ran ( R |` dom inl ) C_ ( ran R u. ran S )
11		xpss12 4877	. . . . 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 ) ) )
12	5, 10, 11	mp2an 430	. . . 4 |- ( ran (inl |` dom R ) X. ran ( R |` dom inl ) ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )
13	2, 12	sstri 3257	. . 3 |- ( R o. `'inl ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )
14		cocnvss 5308	. . . 4 |- ( S o. `'inr ) C_ ( ran (inr |` dom S ) X. ran ( S |` dom inr ) )
15		inrresf1 7392	. . . . . 6 |- (inr |` dom S ) : dom S -1-1-> ( dom R ⊔ dom S )
16		f1rn 5594	. . . . . 6 |- ( (inr |` dom S ) : dom S -1-1-> ( dom R ⊔ dom S ) -> ran (inr |` dom S ) C_ ( dom R ⊔ dom S ) )
17	15, 16	ax-mp 5	. . . . 5 |- ran (inr |` dom S ) C_ ( dom R ⊔ dom S )
18		resss 5082	. . . . . . 7 |- ( S |` dom inr ) C_ S
19		rnss 5007	. . . . . . 7 |- ( ( S |` dom inr ) C_ S -> ran ( S |` dom inr ) C_ ran S )
20	18, 19	ax-mp 5	. . . . . 6 |- ran ( S |` dom inr ) C_ ran S
21		ssun2 3393	. . . . . 6 |- ran S C_ ( ran R u. ran S )
22	20, 21	sstri 3257	. . . . 5 |- ran ( S |` dom inr ) C_ ( ran R u. ran S )
23		xpss12 4877	. . . . 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 ) ) )
24	17, 22, 23	mp2an 430	. . . 4 |- ( ran (inr |` dom S ) X. ran ( S |` dom inr ) ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )
25	14, 24	sstri 3257	. . 3 |- ( S o. `'inr ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )
26	13, 25	unssi 3404	. 2 |- ( ( R o. `'inl ) u. ( S o. `'inr ) ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )
27	1, 26	eqsstri 3280	1 |- case ( R , S ) C_ ( ( dom R ⊔ dom S ) X. ( ran R u. ran S ) )

Syntax hints:   u. cun 3218   C_ wss 3220   X. cxp 4767   `'ccnv 4768   dom cdm 4769   ran crn 4770   |` cres 4771   o. ccom 4773   -1-1->wf1 5369   ⊔ cdju 7367  inlcinl 7375  inrcinr 7376  casecdjucase 7413

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 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 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-2nd 6365  df-1o 6677  df-dju 7368  df-inl 7377  df-inr 7378  df-case 7414

This theorem is referenced by:  casef  7418