Theorem fulltermc2 49757

Description: Given a full functor to a terminal category, the source category must not have empty hom-sets. (Contributed by Zhi Wang, 17-Oct-2025.) (Proof shortened by Zhi Wang, 6-Nov-2025.)

Hypotheses

Ref	Expression
fulltermc.b	⊢ 𝐵 = (Base‘𝐶)
fulltermc.h	⊢ 𝐻 = (Hom ‘𝐶)
fulltermc.d	⊢ (𝜑 → 𝐷 ∈ TermCat)
fulltermc2.f	⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
fulltermc2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
fulltermc2.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
fulltermc2	⊢ (𝜑 → ¬ (𝑋𝐻𝑌) = ∅)

Proof of Theorem fulltermc2

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

Step	Hyp	Ref	Expression
1		oveq1 7365	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
2	1	eqeq1d 2738	. . 3 ⊢ (𝑥 = 𝑋 → ((𝑥𝐻𝑦) = ∅ ↔ (𝑋𝐻𝑦) = ∅))
3	2	notbid 318	. 2 ⊢ (𝑥 = 𝑋 → (¬ (𝑥𝐻𝑦) = ∅ ↔ ¬ (𝑋𝐻𝑦) = ∅))
4		oveq2 7366	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
5	4	eqeq1d 2738	. . 3 ⊢ (𝑦 = 𝑌 → ((𝑋𝐻𝑦) = ∅ ↔ (𝑋𝐻𝑌) = ∅))
6	5	notbid 318	. 2 ⊢ (𝑦 = 𝑌 → (¬ (𝑋𝐻𝑦) = ∅ ↔ ¬ (𝑋𝐻𝑌) = ∅))
7		fulltermc2.f	. . 3 ⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
8		fulltermc.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
9		fulltermc.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
10		fulltermc.d	. . . 4 ⊢ (𝜑 → 𝐷 ∈ TermCat)
11		fullfunc 17832	. . . . . 6 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
12	11	ssbri 5143	. . . . 5 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
13	7, 12	syl 17	. . . 4 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
14	8, 9, 10, 13	fulltermc 49756	. . 3 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ (𝑥𝐻𝑦) = ∅))
15	7, 14	mpbid 232	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ (𝑥𝐻𝑦) = ∅)
16		fulltermc2.x	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
17		fulltermc2.y	. 2 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
18	3, 6, 15, 16, 17	rspc2dv 3591	1 ⊢ (𝜑 → ¬ (𝑋𝐻𝑌) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ∅c0 4285   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  Hom chom 17188   Func cfunc 17778   Full cful 17828  TermCatctermc 49717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-map 8765  df-ixp 8836  df-cat 17591  df-cid 17592  df-func 17782  df-full 17830  df-thinc 49663  df-termc 49718

This theorem is referenced by: (None)