Theorem 0thincg 50293

Description: Any structure with an empty set of objects is a thin category. (Contributed by Zhi Wang, 17-Sep-2024.)

Assertion

Ref	Expression
0thincg	⊢ ((𝐶 ∈ 𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶 ∈ ThinCat)

Proof of Theorem 0thincg

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

Step	Hyp	Ref	Expression
1		0catg 17766	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶 ∈ Cat)
2		ral0 4461	. . . 4 ⊢ ∀𝑥 ∈ ∅ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)
3		raleq 3322	. . . 4 ⊢ (∅ = (Base‘𝐶) → (∀𝑥 ∈ ∅ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
4	2, 3	mpbii 236	. . 3 ⊢ (∅ = (Base‘𝐶) → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))
5	4	adantl 487	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ ∅ = (Base‘𝐶)) → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))
6		eqid 2765	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
7		eqid 2765	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
8	6, 7	isthinc 50254	. 2 ⊢ (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
9	1, 5, 8	sylanbrc 595	1 ⊢ ((𝐶 ∈ 𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶 ∈ ThinCat)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃*wmo 2567  ∀wral 3081  ∅c0 4286  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  Hom chom 17343  Catccat 17742  ThinCatcthinc 50252

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 2148  ax-9 2156  ax-ext 2737  ax-nul 5271

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-sb 2100  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422  df-cat 17746  df-thinc 50253

This theorem is used by:  0thinc  50294