caseinl - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > caseinl		GIF version

Theorem caseinl 7056

Description: Applying the "case" construction to a left injection. (Contributed by Jim Kingdon, 15-Mar-2023.)

**Hypotheses**
Ref	Expression
caseinl.f	⊢ (𝜑 → 𝐹 Fn 𝐵)
caseinl.g	⊢ (𝜑 → Fun 𝐺)
caseinl.a	⊢ (𝜑 → 𝐴 ∈ 𝐵)

**Assertion**
Ref	Expression
caseinl	⊢ (𝜑 → (case(𝐹, 𝐺)‘(inl‘𝐴)) = (𝐹‘𝐴))

**Proof of Theorem caseinl**
Step	Hyp	Ref	Expression
1		df-case 7049	. . . 4 ⊢ case(𝐹, 𝐺) = ((𝐹 ∘ ^◡inl) ∪ (𝐺 ∘ ^◡inr))
2	1	fveq1i 5487	. . 3 ⊢ (case(𝐹, 𝐺)‘(inl‘𝐴)) = (((𝐹 ∘ ^◡inl) ∪ (𝐺 ∘ ^◡inr))‘(inl‘𝐴))
3		caseinl.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐵)
4		fnfun 5285	. . . . . . 7 ⊢ (𝐹 Fn 𝐵 → Fun 𝐹)
5	3, 4	syl 14	. . . . . 6 ⊢ (𝜑 → Fun 𝐹)
6		djulf1o 7023	. . . . . . . 8 ⊢ inl:V–1-1-onto→({∅} × V)
7		f1ocnv 5445	. . . . . . . 8 ⊢ (inl:V–1-1-onto→({∅} × V) → ^◡inl:({∅} × V)–1-1-onto→V)
8	6, 7	ax-mp 5	. . . . . . 7 ⊢ ^◡inl:({∅} × V)–1-1-onto→V
9		f1ofun 5434	. . . . . . 7 ⊢ (^◡inl:({∅} × V)–1-1-onto→V → Fun ^◡inl)
10	8, 9	ax-mp 5	. . . . . 6 ⊢ Fun ^◡inl
11		funco 5228	. . . . . 6 ⊢ ((Fun 𝐹 ∧ Fun ^◡inl) → Fun (𝐹 ∘ ^◡inl))
12	5, 10, 11	sylancl 410	. . . . 5 ⊢ (𝜑 → Fun (𝐹 ∘ ^◡inl))
13		dmco 5112	. . . . . 6 ⊢ dom (𝐹 ∘ ^◡inl) = (^◡^◡inl “ dom 𝐹)
14		df-inl 7012	. . . . . . . . . . 11 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
15	14	funmpt2 5227	. . . . . . . . . 10 ⊢ Fun inl
16		funrel 5205	. . . . . . . . . 10 ⊢ (Fun inl → Rel inl)
17	15, 16	ax-mp 5	. . . . . . . . 9 ⊢ Rel inl
18		dfrel2 5054	. . . . . . . . 9 ⊢ (Rel inl ↔ ^◡^◡inl = inl)
19	17, 18	mpbi 144	. . . . . . . 8 ⊢ ^◡^◡inl = inl
20	19	a1i 9	. . . . . . 7 ⊢ (𝜑 → ^◡^◡inl = inl)
21		fndm 5287	. . . . . . . 8 ⊢ (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵)
22	3, 21	syl 14	. . . . . . 7 ⊢ (𝜑 → dom 𝐹 = 𝐵)
23	20, 22	imaeq12d 4947	. . . . . 6 ⊢ (𝜑 → (^◡^◡inl “ dom 𝐹) = (inl “ 𝐵))
24	13, 23	syl5eq 2211	. . . . 5 ⊢ (𝜑 → dom (𝐹 ∘ ^◡inl) = (inl “ 𝐵))
25		df-fn 5191	. . . . 5 ⊢ ((𝐹 ∘ ^◡inl) Fn (inl “ 𝐵) ↔ (Fun (𝐹 ∘ ^◡inl) ∧ dom (𝐹 ∘ ^◡inl) = (inl “ 𝐵)))
26	12, 24, 25	sylanbrc 414	. . . 4 ⊢ (𝜑 → (𝐹 ∘ ^◡inl) Fn (inl “ 𝐵))
27		caseinl.g	. . . . . 6 ⊢ (𝜑 → Fun 𝐺)
28		djurf1o 7024	. . . . . . . 8 ⊢ inr:V–1-1-onto→({1_o} × V)
29		f1ocnv 5445	. . . . . . . 8 ⊢ (inr:V–1-1-onto→({1_o} × V) → ^◡inr:({1_o} × V)–1-1-onto→V)
30	28, 29	ax-mp 5	. . . . . . 7 ⊢ ^◡inr:({1_o} × V)–1-1-onto→V
31		f1ofun 5434	. . . . . . 7 ⊢ (^◡inr:({1_o} × V)–1-1-onto→V → Fun ^◡inr)
32	30, 31	ax-mp 5	. . . . . 6 ⊢ Fun ^◡inr
33		funco 5228	. . . . . 6 ⊢ ((Fun 𝐺 ∧ Fun ^◡inr) → Fun (𝐺 ∘ ^◡inr))
34	27, 32, 33	sylancl 410	. . . . 5 ⊢ (𝜑 → Fun (𝐺 ∘ ^◡inr))
35		dmco 5112	. . . . . . 7 ⊢ dom (𝐺 ∘ ^◡inr) = (^◡^◡inr “ dom 𝐺)
36		imacnvcnv 5068	. . . . . . 7 ⊢ (^◡^◡inr “ dom 𝐺) = (inr “ dom 𝐺)
37	35, 36	eqtri 2186	. . . . . 6 ⊢ dom (𝐺 ∘ ^◡inr) = (inr “ dom 𝐺)
38	37	a1i 9	. . . . 5 ⊢ (𝜑 → dom (𝐺 ∘ ^◡inr) = (inr “ dom 𝐺))
39		df-fn 5191	. . . . 5 ⊢ ((𝐺 ∘ ^◡inr) Fn (inr “ dom 𝐺) ↔ (Fun (𝐺 ∘ ^◡inr) ∧ dom (𝐺 ∘ ^◡inr) = (inr “ dom 𝐺)))
40	34, 38, 39	sylanbrc 414	. . . 4 ⊢ (𝜑 → (𝐺 ∘ ^◡inr) Fn (inr “ dom 𝐺))
41		djuin 7029	. . . . 5 ⊢ ((inl “ 𝐵) ∩ (inr “ dom 𝐺)) = ∅
42	41	a1i 9	. . . 4 ⊢ (𝜑 → ((inl “ 𝐵) ∩ (inr “ dom 𝐺)) = ∅)
43		caseinl.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
44	43	elexd 2739	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ V)
45		f1odm 5436	. . . . . . . 8 ⊢ (inl:V–1-1-onto→({∅} × V) → dom inl = V)
46	6, 45	ax-mp 5	. . . . . . 7 ⊢ dom inl = V
47	44, 46	eleqtrrdi 2260	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ dom inl)
48	47, 15	jctil 310	. . . . 5 ⊢ (𝜑 → (Fun inl ∧ 𝐴 ∈ dom inl))
49		funfvima 5716	. . . . 5 ⊢ ((Fun inl ∧ 𝐴 ∈ dom inl) → (𝐴 ∈ 𝐵 → (inl‘𝐴) ∈ (inl “ 𝐵)))
50	48, 43, 49	sylc 62	. . . 4 ⊢ (𝜑 → (inl‘𝐴) ∈ (inl “ 𝐵))
51		fvun1 5552	. . . 4 ⊢ (((𝐹 ∘ ^◡inl) Fn (inl “ 𝐵) ∧ (𝐺 ∘ ^◡inr) Fn (inr “ dom 𝐺) ∧ (((inl “ 𝐵) ∩ (inr “ dom 𝐺)) = ∅ ∧ (inl‘𝐴) ∈ (inl “ 𝐵))) → (((𝐹 ∘ ^◡inl) ∪ (𝐺 ∘ ^◡inr))‘(inl‘𝐴)) = ((𝐹 ∘ ^◡inl)‘(inl‘𝐴)))
52	26, 40, 42, 50, 51	syl112anc 1232	. . 3 ⊢ (𝜑 → (((𝐹 ∘ ^◡inl) ∪ (𝐺 ∘ ^◡inr))‘(inl‘𝐴)) = ((𝐹 ∘ ^◡inl)‘(inl‘𝐴)))
53	2, 52	syl5eq 2211	. 2 ⊢ (𝜑 → (case(𝐹, 𝐺)‘(inl‘𝐴)) = ((𝐹 ∘ ^◡inl)‘(inl‘𝐴)))
54		f1ofn 5433	. . . 4 ⊢ (^◡inl:({∅} × V)–1-1-onto→V → ^◡inl Fn ({∅} × V))
55	8, 54	ax-mp 5	. . 3 ⊢ ^◡inl Fn ({∅} × V)
56		f1of 5432	. . . . . 6 ⊢ (inl:V–1-1-onto→({∅} × V) → inl:V⟶({∅} × V))
57	6, 56	ax-mp 5	. . . . 5 ⊢ inl:V⟶({∅} × V)
58	57	a1i 9	. . . 4 ⊢ (𝜑 → inl:V⟶({∅} × V))
59	58, 44	ffvelrnd 5621	. . 3 ⊢ (𝜑 → (inl‘𝐴) ∈ ({∅} × V))
60		fvco2 5555	. . 3 ⊢ ((^◡inl Fn ({∅} × V) ∧ (inl‘𝐴) ∈ ({∅} × V)) → ((𝐹 ∘ ^◡inl)‘(inl‘𝐴)) = (𝐹‘(^◡inl‘(inl‘𝐴))))
61	55, 59, 60	sylancr 411	. 2 ⊢ (𝜑 → ((𝐹 ∘ ^◡inl)‘(inl‘𝐴)) = (𝐹‘(^◡inl‘(inl‘𝐴))))
62		f1ocnvfv1 5745	. . . 4 ⊢ ((inl:V–1-1-onto→({∅} × V) ∧ 𝐴 ∈ V) → (^◡inl‘(inl‘𝐴)) = 𝐴)
63	6, 44, 62	sylancr 411	. . 3 ⊢ (𝜑 → (^◡inl‘(inl‘𝐴)) = 𝐴)
64	63	fveq2d 5490	. 2 ⊢ (𝜑 → (𝐹‘(^◡inl‘(inl‘𝐴))) = (𝐹‘𝐴))
65	53, 61, 64	3eqtrd 2202	1 ⊢ (𝜑 → (case(𝐹, 𝐺)‘(inl‘𝐴)) = (𝐹‘𝐴))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 Vcvv 2726 ∪ cun 3114 ∩ cin 3115 ∅c0 3409 {csn 3576 ⟨cop 3579 × cxp 4602 ^◡ccnv 4603 dom cdm 4604 “ cima 4607 ∘ ccom 4608 Rel wrel 4609 Fun wfun 5182 Fn wfn 5183 ⟶wf 5184 –1-1-onto→wf1o 5187 ‘cfv 5188 1_oc1o 6377 inlcinl 7010 inrcinr 7011 casecdjucase 7048

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 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-nul 4108 ax-pow 4153 ax-pr 4187 ax-un 4411

This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-ral 2449 df-rex 2450 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-mpt 4045 df-tr 4081 df-id 4271 df-iord 4344 df-on 4346 df-suc 4349 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-f1 5193 df-fo 5194 df-f1o 5195 df-fv 5196 df-1st 6108 df-2nd 6109 df-1o 6384 df-inl 7012 df-inr 7013 df-case 7049

This theorem is referenced by: omp1eomlem 7059 ctm 7074

W3C validator