Theorem caseinj 7429

Description: The "case" construction of two injective relations with disjoint ranges is an injective relation. (Contributed by BJ, 10-Jul-2022.)

Hypotheses

Ref	Expression
caseinj.r	|- ( ph -> Fun `' R )
caseinj.s	|- ( ph -> Fun `' S )
caseinj.disj	|- ( ph -> ( ran R i^i ran S ) = (/) )

Assertion

Ref	Expression
caseinj	|- ( ph -> Fun `'case ( R , S ) )

Proof of Theorem caseinj

Step	Hyp	Ref	Expression
1		df-inl 7387	. . . . . . 7 |- inl = ( y e. _V |-> <. (/) , y >. )
2	1	funmpt2 5416	. . . . . 6 |- Fun inl
3		funcnvcnv 5440	. . . . . 6 |- ( Fun inl -> Fun `' `'inl )
4	2, 3	ax-mp 5	. . . . 5 |- Fun `' `'inl
5		caseinj.r	. . . . 5 |- ( ph -> Fun `' R )
6		funco 5417	. . . . 5 |- ( ( Fun `' `'inl /\ Fun `' R ) -> Fun ( `' `'inl o. `' R ) )
7	4, 5, 6	sylancr 418	. . . 4 |- ( ph -> Fun ( `' `'inl o. `' R ) )
8		cnvco 4965	. . . . 5 |- `' ( R o. `'inl ) = ( `' `'inl o. `' R )
9	8	funeqi 5398	. . . 4 |- ( Fun `' ( R o. `'inl ) <-> Fun ( `' `'inl o. `' R ) )
10	7, 9	sylibr 134	. . 3 |- ( ph -> Fun `' ( R o. `'inl ) )
11		df-inr 7388	. . . . . . 7 |- inr = ( x e. _V |-> <. 1o , x >. )
12	11	funmpt2 5416	. . . . . 6 |- Fun inr
13		funcnvcnv 5440	. . . . . 6 |- ( Fun inr -> Fun `' `'inr )
14	12, 13	ax-mp 5	. . . . 5 |- Fun `' `'inr
15		caseinj.s	. . . . 5 |- ( ph -> Fun `' S )
16		funco 5417	. . . . 5 |- ( ( Fun `' `'inr /\ Fun `' S ) -> Fun ( `' `'inr o. `' S ) )
17	14, 15, 16	sylancr 418	. . . 4 |- ( ph -> Fun ( `' `'inr o. `' S ) )
18		cnvco 4965	. . . . 5 |- `' ( S o. `'inr ) = ( `' `'inr o. `' S )
19	18	funeqi 5398	. . . 4 |- ( Fun `' ( S o. `'inr ) <-> Fun ( `' `'inr o. `' S ) )
20	17, 19	sylibr 134	. . 3 |- ( ph -> Fun `' ( S o. `'inr ) )
21		df-rn 4785	. . . . . . 7 |- ran ( R o. `'inl ) = dom `' ( R o. `'inl )
22		rncoss 5053	. . . . . . 7 |- ran ( R o. `'inl ) C_ ran R
23	21, 22	eqsstrri 3281	. . . . . 6 |- dom `' ( R o. `'inl ) C_ ran R
24		df-rn 4785	. . . . . . 7 |- ran ( S o. `'inr ) = dom `' ( S o. `'inr )
25		rncoss 5053	. . . . . . 7 |- ran ( S o. `'inr ) C_ ran S
26	24, 25	eqsstrri 3281	. . . . . 6 |- dom `' ( S o. `'inr ) C_ ran S
27		ss2in 3459	. . . . . 6 |- ( ( dom `' ( R o. `'inl ) C_ ran R /\ dom `' ( S o. `'inr ) C_ ran S ) -> ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) C_ ( ran R i^i ran S ) )
28	23, 26, 27	mp2an 430	. . . . 5 |- ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) C_ ( ran R i^i ran S )
29		caseinj.disj	. . . . 5 |- ( ph -> ( ran R i^i ran S ) = (/) )
30	28, 29	sseqtrid 3298	. . . 4 |- ( ph -> ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) C_ (/) )
31		ss0 3563	. . . 4 |- ( ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) C_ (/) -> ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) = (/) )
32	30, 31	syl 14	. . 3 |- ( ph -> ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) = (/) )
33		funun 5422	. . 3 |- ( ( ( Fun `' ( R o. `'inl ) /\ Fun `' ( S o. `'inr ) ) /\ ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) = (/) ) -> Fun ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) ) )
34	10, 20, 32, 33	syl21anc 1277	. 2 |- ( ph -> Fun ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) ) )
35		df-case 7424	. . . . 5 |- case ( R , S ) = ( ( R o. `'inl ) u. ( S o. `'inr ) )
36	35	cnveqi 4955	. . . 4 |- `'case ( R , S ) = `' ( ( R o. `'inl ) u. ( S o. `'inr ) )
37		cnvun 5193	. . . 4 |- `' ( ( R o. `'inl ) u. ( S o. `'inr ) ) = ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) )
38	36, 37	eqtri 2259	. . 3 |- `'case ( R , S ) = ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) )
39	38	funeqi 5398	. 2 |- ( Fun `'case ( R , S ) <-> Fun ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) ) )
40	34, 39	sylibr 134	1 |- ( ph -> Fun `'case ( R , S ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   _Vcvv 2821   u. cun 3218   i^i cin 3219   C_ wss 3220   (/)c0 3520   <.cop 3712   `'ccnv 4773   dom cdm 4774   ran crn 4775   o. ccom 4778   Fun wfun 5371   1oc1o 6680  inlcinl 7385  inrcinr 7386  casecdjucase 7423

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 4249  ax-pow 4311  ax-pr 4346

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-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-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-fun 5379  df-inl 7387  df-inr 7388  df-case 7424

This theorem is used by:  casef1  7430