Theorem functermc 50434

Description: Functor to a terminal category. (Contributed by Zhi Wang, 17-Oct-2025.)

Hypotheses

Ref	Expression
functermc.d	⊢ (𝜑 → 𝐷 ∈ Cat)
functermc.e	⊢ (𝜑 → 𝐸 ∈ TermCat)
functermc.b	⊢ 𝐵 = (Base‘𝐷)
functermc.c	⊢ 𝐶 = (Base‘𝐸)
functermc.h	⊢ 𝐻 = (Hom ‘𝐷)
functermc.j	⊢ 𝐽 = (Hom ‘𝐸)
functermc.f	⊢ 𝐹 = (𝐵 × 𝐶)
functermc.g	⊢ 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝐻𝑦) × ((𝐹‘𝑥)𝐽(𝐹‘𝑦))))

Assertion

Ref	Expression
functermc	⊢ (𝜑 → (𝐾(𝐷 Func 𝐸)𝐿 ↔ (𝐾 = 𝐹 ∧ 𝐿 = 𝐺)))

Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝑥,𝐻,𝑦   𝑥,𝐽,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)   𝐸(𝑥, 𝑦)   𝐺(𝑥, 𝑦)   𝐾(𝑥, 𝑦)   𝐿(𝑥, 𝑦)

Proof of Theorem functermc

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		functermc.b	. . . 4 ⊢ 𝐵 = (Base‘𝐷)
2		functermc.c	. . . 4 ⊢ 𝐶 = (Base‘𝐸)
3		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝐾(𝐷 Func 𝐸)𝐿) → 𝐾(𝐷 Func 𝐸)𝐿)
4	1, 2, 3	funcf1 17955	. . 3 ⊢ ((𝜑 ∧ 𝐾(𝐷 Func 𝐸)𝐿) → 𝐾:𝐵⟶𝐶)
5		functermc.e	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ TermCat)
6	5, 2	termcbas 50406	. . . . 5 ⊢ (𝜑 → ∃𝑧 𝐶 = {𝑧})
7		feq3 6682	. . . . . . 7 ⊢ (𝐶 = {𝑧} → (𝐾:𝐵⟶𝐶 ↔ 𝐾:𝐵⟶{𝑧}))
8		vex 3454	. . . . . . . . 9 ⊢ 𝑧 ∈ V
9	8	fconst2 7204	. . . . . . . 8 ⊢ (𝐾:𝐵⟶{𝑧} ↔ 𝐾 = (𝐵 × {𝑧}))
10		functermc.f	. . . . . . . . . 10 ⊢ 𝐹 = (𝐵 × 𝐶)
11		xpeq2 5676	. . . . . . . . . 10 ⊢ (𝐶 = {𝑧} → (𝐵 × 𝐶) = (𝐵 × {𝑧}))
12	10, 11	eqtrid 2807	. . . . . . . . 9 ⊢ (𝐶 = {𝑧} → 𝐹 = (𝐵 × {𝑧}))
13	12	eqeq2d 2771	. . . . . . . 8 ⊢ (𝐶 = {𝑧} → (𝐾 = 𝐹 ↔ 𝐾 = (𝐵 × {𝑧})))
14	9, 13	bitr4id 293	. . . . . . 7 ⊢ (𝐶 = {𝑧} → (𝐾:𝐵⟶{𝑧} ↔ 𝐾 = 𝐹))
15	7, 14	bitrd 282	. . . . . 6 ⊢ (𝐶 = {𝑧} → (𝐾:𝐵⟶𝐶 ↔ 𝐾 = 𝐹))
16	15	exlimiv 1963	. . . . 5 ⊢ (∃𝑧 𝐶 = {𝑧} → (𝐾:𝐵⟶𝐶 ↔ 𝐾 = 𝐹))
17	6, 16	syl 18	. . . 4 ⊢ (𝜑 → (𝐾:𝐵⟶𝐶 ↔ 𝐾 = 𝐹))
18	17	biimpa 482	. . 3 ⊢ ((𝜑 ∧ 𝐾:𝐵⟶𝐶) → 𝐾 = 𝐹)
19	4, 18	syldan 603	. 2 ⊢ ((𝜑 ∧ 𝐾(𝐷 Func 𝐸)𝐿) → 𝐾 = 𝐹)
20		functermc.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐷)
21		functermc.j	. . 3 ⊢ 𝐽 = (Hom ‘𝐸)
22		functermc.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
23	5	termcthind 50404	. . 3 ⊢ (𝜑 → 𝐸 ∈ ThinCat)
24	8	fconst 6761	. . . . . 6 ⊢ (𝐵 × {𝑧}):𝐵⟶{𝑧}
25	12	feq1d 6684	. . . . . . 7 ⊢ (𝐶 = {𝑧} → (𝐹:𝐵⟶𝐶 ↔ (𝐵 × {𝑧}):𝐵⟶𝐶))
26		feq3 6682	. . . . . . 7 ⊢ (𝐶 = {𝑧} → ((𝐵 × {𝑧}):𝐵⟶𝐶 ↔ (𝐵 × {𝑧}):𝐵⟶{𝑧}))
27	25, 26	bitrd 282	. . . . . 6 ⊢ (𝐶 = {𝑧} → (𝐹:𝐵⟶𝐶 ↔ (𝐵 × {𝑧}):𝐵⟶{𝑧}))
28	24, 27	mpbiri 261	. . . . 5 ⊢ (𝐶 = {𝑧} → 𝐹:𝐵⟶𝐶)
29	28	exlimiv 1963	. . . 4 ⊢ (∃𝑧 𝐶 = {𝑧} → 𝐹:𝐵⟶𝐶)
30	6, 29	syl 18	. . 3 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
31		functermc.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝐻𝑦) × ((𝐹‘𝑥)𝐽(𝐹‘𝑦))))
32	5	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → 𝐸 ∈ TermCat)
33	30	ffvelcdmda 7077	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵) → (𝐹‘𝑧) ∈ 𝐶)
34	33	adantrr 730	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝐹‘𝑧) ∈ 𝐶)
35	30	ffvelcdmda 7077	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐵) → (𝐹‘𝑤) ∈ 𝐶)
36	35	adantrl 729	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝐹‘𝑤) ∈ 𝐶)
37	32, 2, 34, 36, 21	termchomn0 50410	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ¬ ((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅)
38	37	pm2.21d 122	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅ → (𝑧𝐻𝑤) = ∅))
39	38	ralrimivva 3205	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅ → (𝑧𝐻𝑤) = ∅))
40	1, 2, 20, 21, 22, 23, 30, 31, 39	functhinc 50374	. 2 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐿 ↔ 𝐿 = 𝐺))
41	19, 40	functermclem 50433	1 ⊢ (𝜑 → (𝐾(𝐷 Func 𝐸)𝐿 ↔ (𝐾 = 𝐹 ∧ 𝐿 = 𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∅c0 4279  {csn 4584   class class class wbr 5103   × cxp 5653  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  Basecbs 17301  Hom chom 17353  Catccat 17752   Func cfunc 17943  TermCatctermc 50398

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-map 8828  df-ixp 8905  df-cat 17756  df-cid 17757  df-func 17947  df-thinc 50344  df-termc 50399

This theorem is used by:  functermc2  50435