MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  0catg Structured version   Visualization version   GIF version

Theorem 0catg 16950
Description: Any structure with an empty set of objects is a category. (Contributed by Mario Carneiro, 3-Jan-2017.)
Assertion
Ref Expression
0catg ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶 ∈ Cat)

Proof of Theorem 0catg
Dummy variables 𝑓 𝑔 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 488 . 2 ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → ∅ = (Base‘𝐶))
2 eqidd 2799 . 2 ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → (Hom ‘𝐶) = (Hom ‘𝐶))
3 eqidd 2799 . 2 ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → (comp‘𝐶) = (comp‘𝐶))
4 simpl 486 . 2 ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶𝑉)
5 noel 4247 . . . 4 ¬ 𝑥 ∈ ∅
65pm2.21i 119 . . 3 (𝑥 ∈ ∅ → ∅ ∈ (𝑥(Hom ‘𝐶)𝑥))
76adantl 485 . 2 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ 𝑥 ∈ ∅) → ∅ ∈ (𝑥(Hom ‘𝐶)𝑥))
8 simpr1 1191 . . 3 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥))) → 𝑥 ∈ ∅)
95pm2.21i 119 . . 3 (𝑥 ∈ ∅ → (∅(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓)
108, 9syl 17 . 2 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥))) → (∅(⟨𝑦, 𝑥⟩(comp‘𝐶)𝑥)𝑓) = 𝑓)
11 simpr1 1191 . . 3 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) → 𝑥 ∈ ∅)
125pm2.21i 119 . . 3 (𝑥 ∈ ∅ → (𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)∅) = 𝑓)
1311, 12syl 17 . 2 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))) → (𝑓(⟨𝑥, 𝑥⟩(comp‘𝐶)𝑦)∅) = 𝑓)
14 simp21 1203 . . 3 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑧 ∈ ∅) ∧ (𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧))) → 𝑥 ∈ ∅)
155pm2.21i 119 . . 3 (𝑥 ∈ ∅ → (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥(Hom ‘𝐶)𝑧))
1614, 15syl 17 . 2 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ (𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅ ∧ 𝑧 ∈ ∅) ∧ (𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥(Hom ‘𝐶)𝑧))
17 simp2ll 1237 . . 3 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅) ∧ (𝑧 ∈ ∅ ∧ 𝑤 ∈ ∅)) ∧ (𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ∧ ∈ (𝑧(Hom ‘𝐶)𝑤))) → 𝑥 ∈ ∅)
185pm2.21i 119 . . 3 (𝑥 ∈ ∅ → (((⟨𝑦, 𝑧⟩(comp‘𝐶)𝑤)𝑔)(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑤)𝑓) = ((⟨𝑥, 𝑧⟩(comp‘𝐶)𝑤)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓)))
1917, 18syl 17 . 2 (((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) ∧ ((𝑥 ∈ ∅ ∧ 𝑦 ∈ ∅) ∧ (𝑧 ∈ ∅ ∧ 𝑤 ∈ ∅)) ∧ (𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ∧ ∈ (𝑧(Hom ‘𝐶)𝑤))) → (((⟨𝑦, 𝑧⟩(comp‘𝐶)𝑤)𝑔)(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑤)𝑓) = ((⟨𝑥, 𝑧⟩(comp‘𝐶)𝑤)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓)))
201, 2, 3, 4, 7, 10, 13, 16, 19iscatd 16936 1 ((𝐶𝑉 ∧ ∅ = (Base‘𝐶)) → 𝐶 ∈ Cat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1084   = wceq 1538  wcel 2111  c0 4243  cop 4531  cfv 6324  (class class class)co 7135  Basecbs 16475  Hom chom 16568  compcco 16569  Catccat 16927
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-nul 5174
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-iota 6283  df-fv 6332  df-ov 7138  df-cat 16931
This theorem is referenced by:  0cat  16951
  Copyright terms: Public domain W3C validator