Theorem nelsubc2 49432

Description: An empty "hom-set" for non-empty base is not a subcategory. (Contributed by Zhi Wang, 5-Nov-2025.)

Hypotheses

Ref	Expression
nelsubc.b	⊢ 𝐵 = (Base‘𝐶)
nelsubc.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
nelsubc.0	⊢ (𝜑 → 𝑆 ≠ ∅)
nelsubc.j	⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
nelsubc2.c	⊢ (𝜑 → 𝐶 ∈ Cat)

Assertion

Ref	Expression
nelsubc2	⊢ (𝜑 → ¬ 𝐽 ∈ (Subcat‘𝐶))

Proof of Theorem nelsubc2

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

Step	Hyp	Ref	Expression
1		nelsubc.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
2		nelsubc.s	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
3		nelsubc.0	. . . . 5 ⊢ (𝜑 → 𝑆 ≠ ∅)
4		nelsubc.j	. . . . 5 ⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
5		eqid 2737	. . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
6		eqid 2737	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
7		eqid 2737	. . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶)
8	1, 2, 3, 4, 5, 6, 7	nelsubc 49431	. . . 4 ⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat (Homf ‘𝐶) ∧ (¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))
9	8	simprrd 774	. . 3 ⊢ (𝜑 → (¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
10	9	simpld 494	. 2 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥))
11		nelsubc2.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat)
12	8	simpld 494	. . . . . 6 ⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
13	5, 6, 7, 11, 12	issubc2 17772	. . . . 5 ⊢ (𝜑 → (𝐽 ∈ (Subcat‘𝐶) ↔ (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))
14	13	simplbda 499	. . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
15		r19.26 3098	. . . 4 ⊢ (∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)) ↔ (∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
16	14, 15	sylib 218	. . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → (∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
17	16	simpld 494	. 2 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥))
18	10, 17	mtand 816	1 ⊢ (𝜑 → ¬ 𝐽 ∈ (Subcat‘𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ⊆ wss 3903  ∅c0 4287  {csn 4582  ⟨cop 4588   class class class wbr 5100   × cxp 5630   Fn wfn 6495  ‘cfv 6500  (class class class)co 7368  Basecbs 17148  compcco 17201  Catccat 17599  Idccid 17600  Hom_f chomf 17601   ⊆_cat cssc 17743  Subcatcsubc 17745

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-pm 8778  df-ixp 8848  df-homf 17605  df-ssc 17746  df-subc 17748

This theorem is referenced by: (None)