Theorem nelsubc 49558

Description: An empty "hom-set" for non-empty base satisfies all conditions for a subcategory but the existence of identity morphisms. (Contributed by Zhi Wang, 5-Nov-2025.)

Hypotheses

Ref	Expression
nelsubc.b	⊢ 𝐵 = (Base‘𝐶)
nelsubc.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
nelsubc.0	⊢ (𝜑 → 𝑆 ≠ ∅)
nelsubc.j	⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
nelsubc.h	⊢ 𝐻 = (Homf ‘𝐶)
nelsubc.i	⊢ 1 = (Id‘𝐶)
nelsubc.o	⊢ · = (comp‘𝐶)

Assertion

Ref	Expression
nelsubc	⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat 𝐻 ∧ (¬ ∀𝑥 ∈ 𝑆 ( 1 ‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))

Distinct variable groups:   𝑓,𝐽   𝑥,𝑆,𝑦,𝑧   𝑥,𝑓,𝑦   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑓,𝑔)   𝐵(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐶(𝑥,𝑦,𝑧,𝑓,𝑔)   𝑆(𝑓,𝑔)   · (𝑥,𝑦,𝑧,𝑓,𝑔)   1 (𝑥,𝑦,𝑧,𝑓,𝑔)   𝐻(𝑥,𝑦,𝑧,𝑓,𝑔)   𝐽(𝑥,𝑦,𝑧,𝑔)

Proof of Theorem nelsubc

Step	Hyp	Ref	Expression
1		nelsubc.b	. 2 ⊢ 𝐵 = (Base‘𝐶)
2		nelsubc.s	. 2 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
3		nelsubc.0	. 2 ⊢ (𝜑 → 𝑆 ≠ ∅)
4		nelsubc.j	. 2 ⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
5		nelsubc.h	. 2 ⊢ 𝐻 = (Homf ‘𝐶)
6	1, 2, 3, 4, 5	nelsubclem 49557	1 ⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat 𝐻 ∧ (¬ ∀𝑥 ∈ 𝑆 ( 1 ‘𝑥) ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)∀𝑔 ∈ (𝑦𝐽𝑧)(𝑔(⟨𝑥, 𝑦⟩ · 𝑧)𝑓) ∈ (𝑥𝐽𝑧)))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052   ⊆ wss 3890  ∅c0 4274  {csn 4568  ⟨cop 4574   class class class wbr 5086   × cxp 5623   Fn wfn 6488  ‘cfv 6493  (class class class)co 7361  Basecbs 17173  compcco 17226  Idccid 17625  Hom_f chomf 17626   ⊆_cat cssc 17768

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 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

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 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-ixp 8840  df-homf 17630  df-ssc 17771

This theorem is referenced by:  nelsubc2  49559