diag2f1o - Mathbox for Zhi Wang

	Mathbox for Zhi Wang		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > diag2f1o		Structured version Visualization version GIF version

Theorem diag2f1o 50343

Description: If 𝐷 is terminal, the morphism part of a diagonal functor is bijective functions from hom-sets into sets of natural transformations. (Contributed by Zhi Wang, 21-Oct-2025.)

**Hypotheses**
Ref	Expression
diag2f1o.l	⊢ 𝐿 = (𝐶Δ_func𝐷)
diag2f1o.a	⊢ 𝐴 = (Base‘𝐶)
diag2f1o.h	⊢ 𝐻 = (Hom ‘𝐶)
diag2f1o.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)
diag2f1o.y	⊢ (𝜑 → 𝑌 ∈ 𝐴)
diag2f1o.n	⊢ 𝑁 = (𝐷 Nat 𝐶)
diag2f1o.d	⊢ (𝜑 → 𝐷 ∈ TermCat)
diag2f1o.c	⊢ (𝜑 → 𝐶 ∈ Cat)

**Assertion**
Ref	Expression
diag2f1o	⊢ (𝜑 → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1-onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))

Proof of Theorem diag2f1o Dummy variables 𝑓 𝑚 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		diag2f1o.l	. . 3 ⊢ 𝐿 = (𝐶Δ_func𝐷)
2		diag2f1o.a	. . 3 ⊢ 𝐴 = (Base‘𝐶)
3		eqid 2762	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
4		diag2f1o.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
5		diag2f1o.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
6		diag2f1o.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ TermCat)
7	6	termccd 50285	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
8		diag2f1o.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
9		diag2f1o.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
10	3	istermc2 50281	. . . . . . 7 ⊢ (𝐷 ∈ TermCat ↔ (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
11	6, 10	sylib 221	. . . . . 6 ⊢ (𝜑 → (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
12	11	simprd 500	. . . . 5 ⊢ (𝜑 → ∃!𝑧 𝑧 ∈ (Base‘𝐷))
13		euex 2604	. . . . 5 ⊢ (∃!𝑧 𝑧 ∈ (Base‘𝐷) → ∃𝑧 𝑧 ∈ (Base‘𝐷))
14	12, 13	syl 18	. . . 4 ⊢ (𝜑 → ∃𝑧 𝑧 ∈ (Base‘𝐷))
15		n0 4306	. . . 4 ⊢ ((Base‘𝐷) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (Base‘𝐷))
16	14, 15	sylibr 237	. . 3 ⊢ (𝜑 → (Base‘𝐷) ≠ ∅)
17		diag2f1o.n	. . 3 ⊢ 𝑁 = (𝐷 Nat 𝐶)
18	1, 2, 3, 4, 5, 7, 8, 9, 16, 17	diag2f1 50115	. 2 ⊢ (𝜑 → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))
19		f1f 6774	. . . 4 ⊢ ((𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)) → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))
20	18, 19	syl 18	. . 3 ⊢ (𝜑 → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))
21	6, 3	termcbas 50286	. . . . . 6 ⊢ (𝜑 → ∃𝑧(Base‘𝐷) = {𝑧})
22	21	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) → ∃𝑧(Base‘𝐷) = {𝑧})
23		fveq2 6881	. . . . . . 7 ⊢ (𝑓 = (𝑚‘𝑧) → ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓) = ((𝑋(2^nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
24	23	eqeq2d 2773	. . . . . 6 ⊢ (𝑓 = (𝑚‘𝑧) → (𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓) ↔ 𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘(𝑚‘𝑧))))
25	8	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑋 ∈ 𝐴)
26	9	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑌 ∈ 𝐴)
27	6	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝐷 ∈ TermCat)
28		simplr 780	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))
29		vsnid 4628	. . . . . . . . 9 ⊢ 𝑧 ∈ {𝑧}
30		simpr 489	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → (Base‘𝐷) = {𝑧})
31	29, 30	eleqtrrid 2869	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑧 ∈ (Base‘𝐷))
32		eqid 2762	. . . . . . . 8 ⊢ (𝑚‘𝑧) = (𝑚‘𝑧)
33	1, 2, 4, 25, 26, 17, 27, 28, 3, 31, 32	diag2f1olem 50342	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ((𝑚‘𝑧) ∈ (𝑋𝐻𝑌) ∧ 𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘(𝑚‘𝑧))))
34	33	simpld 499	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → (𝑚‘𝑧) ∈ (𝑋𝐻𝑌))
35	33	simprd 500	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
36	24, 34, 35	rspcedvdw 3583	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓))
37	22, 36	exlimddv 1964	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓))
38	37	ralrimiva 3156	. . 3 ⊢ (𝜑 → ∀𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓))
39		dffo3 7097	. . 3 ⊢ ((𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)) ↔ ((𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)) ∧ ∀𝑚 ∈ (((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2^nd ‘𝐿)𝑌)‘𝑓)))
40	20, 38, 39	sylanbrc 594	. 2 ⊢ (𝜑 → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))
41		df-f1o 6543	. 2 ⊢ ((𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1-onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)) ↔ ((𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)) ∧ (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌))))
42	18, 40, 41	sylanbrc 594	1 ⊢ (𝜑 → (𝑋(2^nd ‘𝐿)𝑌):(𝑋𝐻𝑌)–1-1-onto→(((1^st ‘𝐿)‘𝑋)𝑁((1^st ‘𝐿)‘𝑌)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ∃wex 1808 ∈ wcel 2142 ∃!weu 2595 ≠ wne 2957 ∀wral 3078 ∃wrex 3088 ∅c0 4285 {csn 4588 ⟶wf 6532 –1-1→wf1 6533 –onto→wfo 6534 –1-1-onto→wf1o 6535 ‘cfv 6536 (class class class)co 7412 1^st c1st 7982 2^nd c2nd 7983 Basecbs 17275 Hom chom 17327 Catccat 17726 Nat cnat 18007 Δ_funccdiag 18274 ThinCatcthinc 50223 TermCatctermc 50278

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-map 8824 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-z 12598 df-dec 12718 df-uz 12869 df-fz 13542 df-struct 17213 df-slot 17248 df-ndx 17260 df-base 17276 df-hom 17340 df-cco 17341 df-cat 17730 df-cid 17731 df-func 17921 df-nat 18009 df-fuc 18010 df-xpc 18234 df-1stf 18235 df-curf 18276 df-diag 18278 df-thinc 50224 df-termc 50279

This theorem is used by: diagffth 50344

W3C validator