Theorem nelsubc2 50176

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 2761	. . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶)
6		eqid 2761	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
7		eqid 2761	. . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶)
8	1, 2, 3, 4, 5, 6, 7	nelsubc 50175	. . . 4 ⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat (Homf ‘𝐶) ∧ (¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))
9	8	simprrd 786	. . 3 ⊢ (𝜑 → (¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
10	9	simpld 500	. 2 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥))
11		nelsubc2.c	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat)
12	8	simpld 500	. . . . . 6 ⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
13	5, 6, 7, 11, 12	issubc2 18011	. . . . 5 ⊢ (𝜑 → (𝐽 ∈ (Subcat‘𝐶) ↔ (𝐽 ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))
14	13	simplbda 505	. . . 4 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → ∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
15		r19.26 3123	. . . 4 ⊢ (∀𝑥 ∈ 𝑆 (((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)) ↔ (∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
16	14, 15	sylib 221	. . 3 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → (∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝐽𝑧)))
17	16	simpld 500	. 2 ⊢ ((𝜑 ∧ 𝐽 ∈ (Subcat‘𝐶)) → ∀𝑥 ∈ 𝑆 ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐽𝑥))
18	10, 17	mtand 828	1 ⊢ (𝜑 → ¬ 𝐽 ∈ (Subcat‘𝐶))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077   ⊆ wss 3899  ∅c0 4279  {csn 4584  ⟨cop 4590   class class class wbr 5103   × cxp 5649   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  compcco 17440  Catccat 17838  Idccid 17839  Hom_f chomf 17840   ⊆_cat cssc 17982  Subcatcsubc 17984

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-pm 8850  df-ixp 8926  df-homf 17844  df-ssc 17985  df-subc 17987

This theorem is used by: (None)