Theorem functermceu 49503

Description: There exists a unique functor to a terminal category. (Contributed by Zhi Wang, 17-Oct-2025.)

Hypotheses

Ref	Expression
functermceu.c	⊢ (𝜑 → 𝐶 ∈ Cat)
functermceu.d	⊢ (𝜑 → 𝐷 ∈ TermCat)

Assertion

Ref	Expression
functermceu	⊢ (𝜑 → ∃!𝑓 𝑓 ∈ (𝐶 Func 𝐷))

Distinct variable groups:   𝐶,𝑓   𝐷,𝑓

Allowed substitution hint:   𝜑(𝑓)

Proof of Theorem functermceu

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		opex 5427	. . . 4 ⊢ ⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩ ∈ V
2	1	a1i 11	. . 3 ⊢ (𝜑 → ⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩ ∈ V)
3		functermceu.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
4		functermceu.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ TermCat)
5		eqid 2730	. . . 4 ⊢ (Base‘𝐶) = (Base‘𝐶)
6		eqid 2730	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
7		eqid 2730	. . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
8		eqid 2730	. . . 4 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
9		eqid 2730	. . . 4 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = ((Base‘𝐶) × (Base‘𝐷))
10		eqid 2730	. . . 4 ⊢ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦)))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))
11	3, 4, 5, 6, 7, 8, 9, 10	functermc2 49502	. . 3 ⊢ (𝜑 → (𝐶 Func 𝐷) = {⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩})
12		sneq 4602	. . . 4 ⊢ (𝑓 = ⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩ → {𝑓} = {⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩})
13	12	eqeq2d 2741	. . 3 ⊢ (𝑓 = ⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩ → ((𝐶 Func 𝐷) = {𝑓} ↔ (𝐶 Func 𝐷) = {⟨((Base‘𝐶) × (Base‘𝐷)), (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((((Base‘𝐶) × (Base‘𝐷))‘𝑥)(Hom ‘𝐷)(((Base‘𝐶) × (Base‘𝐷))‘𝑦))))⟩}))
14	2, 11, 13	spcedv 3567	. 2 ⊢ (𝜑 → ∃𝑓(𝐶 Func 𝐷) = {𝑓})
15		eusn 4697	. 2 ⊢ (∃!𝑓 𝑓 ∈ (𝐶 Func 𝐷) ↔ ∃𝑓(𝐶 Func 𝐷) = {𝑓})
16	14, 15	sylibr 234	1 ⊢ (𝜑 → ∃!𝑓 𝑓 ∈ (𝐶 Func 𝐷))

Syntax hints:   → wi 4   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∃!weu 2562  Vcvv 3450  {csn 4592  ⟨cop 4598   × cxp 5639  ‘cfv 6514  (class class class)co 7390   ∈ cmpo 7392  Basecbs 17186  Hom chom 17238  Catccat 17632   Func cfunc 17823  TermCatctermc 49465

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-map 8804  df-ixp 8874  df-cat 17636  df-cid 17637  df-func 17827  df-thinc 49411  df-termc 49466

This theorem is referenced by:  termcterm  49506  termc  49512