Theorem caseinr 6985

Description: Applying the "case" construction to a right injection. (Contributed by Jim Kingdon, 12-Jul-2023.)

Hypotheses

Ref	Expression
caseinr.f	|- ( ph -> Fun F )
caseinr.g	|- ( ph -> G Fn B )
caseinr.a	|- ( ph -> A e. B )

Assertion

Ref	Expression
caseinr	|- ( ph -> (case ( F , G ) ` (inr ` A ) ) = ( G ` A ) )

Proof of Theorem caseinr

Step	Hyp	Ref	Expression
1		df-case 6977	. . . 4 |- case ( F , G ) = ( ( F o. `'inl ) u. ( G o. `'inr ) )
2	1	fveq1i 5430	. . 3 |- (case ( F , G ) ` (inr ` A ) ) = ( ( ( F o. `'inl ) u. ( G o. `'inr ) ) ` (inr ` A ) )
3		caseinr.f	. . . . . 6 |- ( ph -> Fun F )
4		djulf1o 6951	. . . . . . . 8 |- inl : _V -1-1-onto-> ( { (/) } X. _V )
5		f1ocnv 5388	. . . . . . . 8 |- (inl : _V -1-1-onto-> ( { (/) } X. _V ) -> `'inl : ( { (/) } X. _V ) -1-1-onto-> _V )
6	4, 5	ax-mp 5	. . . . . . 7 |- `'inl : ( { (/) } X. _V ) -1-1-onto-> _V
7		f1ofun 5377	. . . . . . 7 |- ( `'inl : ( { (/) } X. _V ) -1-1-onto-> _V -> Fun `'inl )
8	6, 7	ax-mp 5	. . . . . 6 |- Fun `'inl
9		funco 5171	. . . . . 6 |- ( ( Fun F /\ Fun `'inl ) -> Fun ( F o. `'inl ) )
10	3, 8, 9	sylancl 410	. . . . 5 |- ( ph -> Fun ( F o. `'inl ) )
11		dmco 5055	. . . . . . 7 |- dom ( F o. `'inl ) = ( `' `'inl " dom F )
12		imacnvcnv 5011	. . . . . . 7 |- ( `' `'inl " dom F ) = (inl " dom F )
13	11, 12	eqtri 2161	. . . . . 6 |- dom ( F o. `'inl ) = (inl " dom F )
14	13	a1i 9	. . . . 5 |- ( ph -> dom ( F o. `'inl ) = (inl " dom F ) )
15		df-fn 5134	. . . . 5 |- ( ( F o. `'inl ) Fn (inl " dom F ) <-> ( Fun ( F o. `'inl ) /\ dom ( F o. `'inl ) = (inl " dom F ) ) )
16	10, 14, 15	sylanbrc 414	. . . 4 |- ( ph -> ( F o. `'inl ) Fn (inl " dom F ) )
17		caseinr.g	. . . . . . 7 |- ( ph -> G Fn B )
18		fnfun 5228	. . . . . . 7 |- ( G Fn B -> Fun G )
19	17, 18	syl 14	. . . . . 6 |- ( ph -> Fun G )
20		djurf1o 6952	. . . . . . . 8 |- inr : _V -1-1-onto-> ( { 1o } X. _V )
21		f1ocnv 5388	. . . . . . . 8 |- (inr : _V -1-1-onto-> ( { 1o } X. _V ) -> `'inr : ( { 1o } X. _V ) -1-1-onto-> _V )
22	20, 21	ax-mp 5	. . . . . . 7 |- `'inr : ( { 1o } X. _V ) -1-1-onto-> _V
23		f1ofun 5377	. . . . . . 7 |- ( `'inr : ( { 1o } X. _V ) -1-1-onto-> _V -> Fun `'inr )
24	22, 23	ax-mp 5	. . . . . 6 |- Fun `'inr
25		funco 5171	. . . . . 6 |- ( ( Fun G /\ Fun `'inr ) -> Fun ( G o. `'inr ) )
26	19, 24, 25	sylancl 410	. . . . 5 |- ( ph -> Fun ( G o. `'inr ) )
27		dmco 5055	. . . . . 6 |- dom ( G o. `'inr ) = ( `' `'inr " dom G )
28		df-inr 6941	. . . . . . . . . . 11 |- inr = ( x e. _V |-> <. 1o , x >. )
29	28	funmpt2 5170	. . . . . . . . . 10 |- Fun inr
30		funrel 5148	. . . . . . . . . 10 |- ( Fun inr -> Rel inr )
31	29, 30	ax-mp 5	. . . . . . . . 9 |- Rel inr
32		dfrel2 4997	. . . . . . . . 9 |- ( Rel inr <-> `' `'inr = inr )
33	31, 32	mpbi 144	. . . . . . . 8 |- `' `'inr = inr
34	33	a1i 9	. . . . . . 7 |- ( ph -> `' `'inr = inr )
35		fndm 5230	. . . . . . . 8 |- ( G Fn B -> dom G = B )
36	17, 35	syl 14	. . . . . . 7 |- ( ph -> dom G = B )
37	34, 36	imaeq12d 4890	. . . . . 6 |- ( ph -> ( `' `'inr " dom G ) = (inr " B ) )
38	27, 37	syl5eq 2185	. . . . 5 |- ( ph -> dom ( G o. `'inr ) = (inr " B ) )
39		df-fn 5134	. . . . 5 |- ( ( G o. `'inr ) Fn (inr " B ) <-> ( Fun ( G o. `'inr ) /\ dom ( G o. `'inr ) = (inr " B ) ) )
40	26, 38, 39	sylanbrc 414	. . . 4 |- ( ph -> ( G o. `'inr ) Fn (inr " B ) )
41		djuin 6957	. . . . 5 |- ( (inl " dom F ) i^i (inr " B ) ) = (/)
42	41	a1i 9	. . . 4 |- ( ph -> ( (inl " dom F ) i^i (inr " B ) ) = (/) )
43		caseinr.a	. . . . . . . 8 |- ( ph -> A e. B )
44	43	elexd 2702	. . . . . . 7 |- ( ph -> A e. _V )
45		f1odm 5379	. . . . . . . 8 |- (inr : _V -1-1-onto-> ( { 1o } X. _V ) -> dom inr = _V )
46	20, 45	ax-mp 5	. . . . . . 7 |- dom inr = _V
47	44, 46	eleqtrrdi 2234	. . . . . 6 |- ( ph -> A e. dom inr )
48	47, 29	jctil 310	. . . . 5 |- ( ph -> ( Fun inr /\ A e. dom inr ) )
49		funfvima 5657	. . . . 5 |- ( ( Fun inr /\ A e. dom inr ) -> ( A e. B -> (inr ` A ) e. (inr " B ) ) )
50	48, 43, 49	sylc 62	. . . 4 |- ( ph -> (inr ` A ) e. (inr " B ) )
51		fvun2 5496	. . . 4 |- ( ( ( F o. `'inl ) Fn (inl " dom F ) /\ ( G o. `'inr ) Fn (inr " B ) /\ ( ( (inl " dom F ) i^i (inr " B ) ) = (/) /\ (inr ` A ) e. (inr " B ) ) ) -> ( ( ( F o. `'inl ) u. ( G o. `'inr ) ) ` (inr ` A ) ) = ( ( G o. `'inr ) ` (inr ` A ) ) )
52	16, 40, 42, 50, 51	syl112anc 1221	. . 3 |- ( ph -> ( ( ( F o. `'inl ) u. ( G o. `'inr ) ) ` (inr ` A ) ) = ( ( G o. `'inr ) ` (inr ` A ) ) )
53	2, 52	syl5eq 2185	. 2 |- ( ph -> (case ( F , G ) ` (inr ` A ) ) = ( ( G o. `'inr ) ` (inr ` A ) ) )
54		f1ofn 5376	. . . 4 |- ( `'inr : ( { 1o } X. _V ) -1-1-onto-> _V -> `'inr Fn ( { 1o } X. _V ) )
55	22, 54	ax-mp 5	. . 3 |- `'inr Fn ( { 1o } X. _V )
56		f1of 5375	. . . . . 6 |- (inr : _V -1-1-onto-> ( { 1o } X. _V ) -> inr : _V --> ( { 1o } X. _V ) )
57	20, 56	ax-mp 5	. . . . 5 |- inr : _V --> ( { 1o } X. _V )
58	57	a1i 9	. . . 4 |- ( ph -> inr : _V --> ( { 1o } X. _V ) )
59	58, 44	ffvelrnd 5564	. . 3 |- ( ph -> (inr ` A ) e. ( { 1o } X. _V ) )
60		fvco2 5498	. . 3 |- ( ( `'inr Fn ( { 1o } X. _V ) /\ (inr ` A ) e. ( { 1o } X. _V ) ) -> ( ( G o. `'inr ) ` (inr ` A ) ) = ( G ` ( `'inr ` (inr ` A ) ) ) )
61	55, 59, 60	sylancr 411	. 2 |- ( ph -> ( ( G o. `'inr ) ` (inr ` A ) ) = ( G ` ( `'inr ` (inr ` A ) ) ) )
62		f1ocnvfv1 5686	. . . 4 |- ( (inr : _V -1-1-onto-> ( { 1o } X. _V ) /\ A e. _V ) -> ( `'inr ` (inr ` A ) ) = A )
63	20, 44, 62	sylancr 411	. . 3 |- ( ph -> ( `'inr ` (inr ` A ) ) = A )
64	63	fveq2d 5433	. 2 |- ( ph -> ( G ` ( `'inr ` (inr ` A ) ) ) = ( G ` A ) )
65	53, 61, 64	3eqtrd 2177	1 |- ( ph -> (case ( F , G ) ` (inr ` A ) ) = ( G ` A ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1332   e. wcel 1481   _Vcvv 2689   u. cun 3074   i^i cin 3075   (/)c0 3368   {csn 3532   <.cop 3535   X. cxp 4545   `'ccnv 4546   dom cdm 4547   "cima 4550   o. ccom 4551   Rel wrel 4552   Fun wfun 5125   Fn wfn 5126   -->wf 5127   -1-1-onto->wf1o 5130   ` cfv 5131   1oc1o 6314  inlcinl 6938  inrcinr 6939  casecdjucase 6976

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-1st 6046  df-2nd 6047  df-1o 6321  df-inl 6940  df-inr 6941  df-case 6977

This theorem is referenced by:  omp1eomlem  6987