Theorem caserel 7433

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 7430	. 2 |- case ( R , S ) = ( ( R o. `'inl ) u. ( S o. `'inr ) )
2		cocnvss 5316	. . . 4 |- ( R o. `'inl ) C_ ( ran (inl |` dom R ) X. ran ( R |` dom inl ) )
3		inlresf1 7407	. . . . . 6 |- (inl |` dom R ) : dom R -1-1-> ( dom R ⊔ dom S )
4		f1rn 5602	. . . . . 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 5089	. . . . . . 7 |- ( R |` dom inl ) C_ R
7		rnss 5014	. . . . . . 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 4884	. . . . 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 5316	. . . 4 |- ( S o. `'inr ) C_ ( ran (inr |` dom S ) X. ran ( S |` dom inr ) )
15		inrresf1 7408	. . . . . 6 |- (inr |` dom S ) : dom S -1-1-> ( dom R ⊔ dom S )
16		f1rn 5602	. . . . . 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 5089	. . . . . . 7 |- ( S |` dom inr ) C_ S
19		rnss 5014	. . . . . . 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 4884	. . . . 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 ) )

This proof depends on syntax axioms:   u. cun 3218   C_ wss 3220   X. cxp 4774   `'ccnv 4775   dom cdm 4776   ran crn 4777   |` cres 4778   o. ccom 4780   -1-1->wf1 5377   ⊔ cdju 7383  inlcinl 7391  inrcinr 7392  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-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 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-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:  casef  7434