Theorem caseinj 7148

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 7106	. . . . . . 7 |- inl = ( y e. _V |-> <. (/) , y >. )
2	1	funmpt2 5293	. . . . . 6 |- Fun inl
3		funcnvcnv 5313	. . . . . 6 |- ( Fun inl -> Fun `' `'inl )
4	2, 3	ax-mp 5	. . . . 5 |- Fun `' `'inl
5		caseinj.r	. . . . 5 |- ( ph -> Fun `' R )
6		funco 5294	. . . . 5 |- ( ( Fun `' `'inl /\ Fun `' R ) -> Fun ( `' `'inl o. `' R ) )
7	4, 5, 6	sylancr 414	. . . 4 |- ( ph -> Fun ( `' `'inl o. `' R ) )
8		cnvco 4847	. . . . 5 |- `' ( R o. `'inl ) = ( `' `'inl o. `' R )
9	8	funeqi 5275	. . . 4 |- ( Fun `' ( R o. `'inl ) <-> Fun ( `' `'inl o. `' R ) )
10	7, 9	sylibr 134	. . 3 |- ( ph -> Fun `' ( R o. `'inl ) )
11		df-inr 7107	. . . . . . 7 |- inr = ( x e. _V |-> <. 1o , x >. )
12	11	funmpt2 5293	. . . . . 6 |- Fun inr
13		funcnvcnv 5313	. . . . . 6 |- ( Fun inr -> Fun `' `'inr )
14	12, 13	ax-mp 5	. . . . 5 |- Fun `' `'inr
15		caseinj.s	. . . . 5 |- ( ph -> Fun `' S )
16		funco 5294	. . . . 5 |- ( ( Fun `' `'inr /\ Fun `' S ) -> Fun ( `' `'inr o. `' S ) )
17	14, 15, 16	sylancr 414	. . . 4 |- ( ph -> Fun ( `' `'inr o. `' S ) )
18		cnvco 4847	. . . . 5 |- `' ( S o. `'inr ) = ( `' `'inr o. `' S )
19	18	funeqi 5275	. . . 4 |- ( Fun `' ( S o. `'inr ) <-> Fun ( `' `'inr o. `' S ) )
20	17, 19	sylibr 134	. . 3 |- ( ph -> Fun `' ( S o. `'inr ) )
21		df-rn 4670	. . . . . . 7 |- ran ( R o. `'inl ) = dom `' ( R o. `'inl )
22		rncoss 4932	. . . . . . 7 |- ran ( R o. `'inl ) C_ ran R
23	21, 22	eqsstrri 3212	. . . . . 6 |- dom `' ( R o. `'inl ) C_ ran R
24		df-rn 4670	. . . . . . 7 |- ran ( S o. `'inr ) = dom `' ( S o. `'inr )
25		rncoss 4932	. . . . . . 7 |- ran ( S o. `'inr ) C_ ran S
26	24, 25	eqsstrri 3212	. . . . . 6 |- dom `' ( S o. `'inr ) C_ ran S
27		ss2in 3387	. . . . . 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 426	. . . . 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 3229	. . . 4 |- ( ph -> ( dom `' ( R o. `'inl ) i^i dom `' ( S o. `'inr ) ) C_ (/) )
31		ss0 3487	. . . 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 5298	. . 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 1248	. 2 |- ( ph -> Fun ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) ) )
35		df-case 7143	. . . . 5 |- case ( R , S ) = ( ( R o. `'inl ) u. ( S o. `'inr ) )
36	35	cnveqi 4837	. . . 4 |- `'case ( R , S ) = `' ( ( R o. `'inl ) u. ( S o. `'inr ) )
37		cnvun 5071	. . . 4 |- `' ( ( R o. `'inl ) u. ( S o. `'inr ) ) = ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) )
38	36, 37	eqtri 2214	. . 3 |- `'case ( R , S ) = ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) )
39	38	funeqi 5275	. 2 |- ( Fun `'case ( R , S ) <-> Fun ( `' ( R o. `'inl ) u. `' ( S o. `'inr ) ) )
40	34, 39	sylibr 134	1 |- ( ph -> Fun `'case ( R , S ) )

Syntax hints:   -> wi 4   = wceq 1364   _Vcvv 2760   u. cun 3151   i^i cin 3152   C_ wss 3153   (/)c0 3446   <.cop 3621   `'ccnv 4658   dom cdm 4659   ran crn 4660   o. ccom 4663   Fun wfun 5248   1oc1o 6462  inlcinl 7104  inrcinr 7105  casecdjucase 7142

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-fun 5256  df-inl 7106  df-inr 7107  df-case 7143

This theorem is referenced by:  casef1  7149