Theorem casefun 7425

Description: The "case" construction of two functions is a function. (Contributed by BJ, 10-Jul-2022.)

Hypotheses

Ref	Expression
casefun.f	|- ( ph -> Fun F )
casefun.g	|- ( ph -> Fun G )

Assertion

Ref	Expression
casefun	|- ( ph -> Fun case ( F , G ) )

Proof of Theorem casefun

Step	Hyp	Ref	Expression
1		casefun.f	. . . 4 |- ( ph -> Fun F )
2		djulf1o 7398	. . . . . 6 |- inl : _V -1-1-onto-> ( { (/) } X. _V )
3		f1of1 5638	. . . . . 6 |- (inl : _V -1-1-onto-> ( { (/) } X. _V ) -> inl : _V -1-1-> ( { (/) } X. _V ) )
4	2, 3	ax-mp 5	. . . . 5 |- inl : _V -1-1-> ( { (/) } X. _V )
5		df-f1 5382	. . . . . 6 |- (inl : _V -1-1-> ( { (/) } X. _V ) <-> (inl : _V --> ( { (/) } X. _V ) /\ Fun `'inl ) )
6	5	simprbi 275	. . . . 5 |- (inl : _V -1-1-> ( { (/) } X. _V ) -> Fun `'inl )
7	4, 6	mp1i 10	. . . 4 |- ( ph -> Fun `'inl )
8		funco 5417	. . . 4 |- ( ( Fun F /\ Fun `'inl ) -> Fun ( F o. `'inl ) )
9	1, 7, 8	syl2anc 415	. . 3 |- ( ph -> Fun ( F o. `'inl ) )
10		casefun.g	. . . 4 |- ( ph -> Fun G )
11		djurf1o 7399	. . . . . 6 |- inr : _V -1-1-onto-> ( { 1o } X. _V )
12		f1of1 5638	. . . . . 6 |- (inr : _V -1-1-onto-> ( { 1o } X. _V ) -> inr : _V -1-1-> ( { 1o } X. _V ) )
13	11, 12	ax-mp 5	. . . . 5 |- inr : _V -1-1-> ( { 1o } X. _V )
14		df-f1 5382	. . . . . 6 |- (inr : _V -1-1-> ( { 1o } X. _V ) <-> (inr : _V --> ( { 1o } X. _V ) /\ Fun `'inr ) )
15	14	simprbi 275	. . . . 5 |- (inr : _V -1-1-> ( { 1o } X. _V ) -> Fun `'inr )
16	13, 15	mp1i 10	. . . 4 |- ( ph -> Fun `'inr )
17		funco 5417	. . . 4 |- ( ( Fun G /\ Fun `'inr ) -> Fun ( G o. `'inr ) )
18	10, 16, 17	syl2anc 415	. . 3 |- ( ph -> Fun ( G o. `'inr ) )
19		dmcoss 5052	. . . . . . 7 |- dom ( F o. `'inl ) C_ dom `'inl
20		df-rn 4785	. . . . . . 7 |- ran inl = dom `'inl
21	19, 20	sseqtrri 3283	. . . . . 6 |- dom ( F o. `'inl ) C_ ran inl
22		dmcoss 5052	. . . . . . 7 |- dom ( G o. `'inr ) C_ dom `'inr
23		df-rn 4785	. . . . . . 7 |- ran inr = dom `'inr
24	22, 23	sseqtrri 3283	. . . . . 6 |- dom ( G o. `'inr ) C_ ran inr
25		ss2in 3459	. . . . . 6 |- ( ( dom ( F o. `'inl ) C_ ran inl /\ dom ( G o. `'inr ) C_ ran inr ) -> ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) C_ ( ran inl i^i ran inr ) )
26	21, 24, 25	mp2an 430	. . . . 5 |- ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) C_ ( ran inl i^i ran inr )
27		rnresv 5247	. . . . . . . . 9 |- ran (inl |` _V ) = ran inl
28	27	eqcomi 2242	. . . . . . . 8 |- ran inl = ran (inl |` _V )
29		rnresv 5247	. . . . . . . . 9 |- ran (inr |` _V ) = ran inr
30	29	eqcomi 2242	. . . . . . . 8 |- ran inr = ran (inr |` _V )
31	28, 30	ineq12i 3430	. . . . . . 7 |- ( ran inl i^i ran inr ) = ( ran (inl |` _V ) i^i ran (inr |` _V ) )
32		djuinr 7403	. . . . . . 7 |- ( ran (inl |` _V ) i^i ran (inr |` _V ) ) = (/)
33	31, 32	eqtri 2259	. . . . . 6 |- ( ran inl i^i ran inr ) = (/)
34	33	a1i 9	. . . . 5 |- ( ph -> ( ran inl i^i ran inr ) = (/) )
35	26, 34	sseqtrid 3298	. . . 4 |- ( ph -> ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) C_ (/) )
36		ss0 3563	. . . 4 |- ( ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) C_ (/) -> ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) = (/) )
37	35, 36	syl 14	. . 3 |- ( ph -> ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) = (/) )
38		funun 5422	. . 3 |- ( ( ( Fun ( F o. `'inl ) /\ Fun ( G o. `'inr ) ) /\ ( dom ( F o. `'inl ) i^i dom ( G o. `'inr ) ) = (/) ) -> Fun ( ( F o. `'inl ) u. ( G o. `'inr ) ) )
39	9, 18, 37, 38	syl21anc 1277	. 2 |- ( ph -> Fun ( ( F o. `'inl ) u. ( G o. `'inr ) ) )
40		df-case 7424	. . 3 |- case ( F , G ) = ( ( F o. `'inl ) u. ( G o. `'inr ) )
41	40	funeqi 5398	. 2 |- ( Fun case ( F , G ) <-> Fun ( ( F o. `'inl ) u. ( G o. `'inr ) ) )
42	39, 41	sylibr 134	1 |- ( ph -> Fun case ( F , G ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   _Vcvv 2821   u. cun 3218   i^i cin 3219   C_ wss 3220   (/)c0 3520   {csn 3709   X. cxp 4772   `'ccnv 4773   dom cdm 4774   ran crn 4775   |` cres 4776   o. ccom 4778   Fun wfun 5371   -->wf 5373   -1-1->wf1 5374   -1-1-onto->wf1o 5376   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-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  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 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-inl 7387  df-inr 7388  df-case 7424

This theorem is used by:  casef  7428