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

Theorem 0subcat 18019
Description: For any category 𝐶, the empty set is a (full) subcategory of 𝐶, see example 4.3(1.a) in [Adamek] p. 48. (Contributed by AV, 23-Apr-2020.)
Assertion
Ref Expression
0subcat (𝐶 ∈ Cat → ∅ ∈ (Subcat‘𝐶))

Proof of Theorem 0subcat
Dummy variables 𝑓 𝑔 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ssc 18018 . 2 (𝐶 ∈ Cat → ∅ ⊆cat (Homf ‘𝐶))
2 ral0 4453 . . 3 ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧))
32a1i 11 . 2 (𝐶 ∈ Cat → ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧)))
4 eqid 2760 . . 3 (Homf ‘𝐶) = (Homf ‘𝐶)
5 eqid 2760 . . 3 (Id‘𝐶) = (Id‘𝐶)
6 eqid 2760 . . 3 (comp‘𝐶) = (comp‘𝐶)
7 id 23 . . 3 (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8 f0 6764 . . . . . 6 ∅:∅⟶∅
9 ffn 6710 . . . . . 6 (∅:∅⟶∅ → ∅ Fn ∅)
108, 9ax-mp 5 . . . . 5 ∅ Fn ∅
11 0xp 5749 . . . . . 6 (∅ × ∅) = ∅
1211fneq2i 6638 . . . . 5 (∅ Fn (∅ × ∅) ↔ ∅ Fn ∅)
1310, 12mpbir 234 . . . 4 ∅ Fn (∅ × ∅)
1413a1i 11 . . 3 (𝐶 ∈ Cat → ∅ Fn (∅ × ∅))
154, 5, 6, 7, 14issubc2 18017 . 2 (𝐶 ∈ Cat → (∅ ∈ (Subcat‘𝐶) ↔ (∅ ⊆cat (Homf ‘𝐶) ∧ ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧)))))
161, 3, 15mpbir2and 726 1 (𝐶 ∈ Cat → ∅ ∈ (Subcat‘𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∀wral 3076  ∅c0 4278  ⟨cop 4834   class class class wbr 5102   × cxp 5648   Fn wfn 6534  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421  compcco 17446  Catccat 17844  Idccid 17845  Homf chomf 17846   ⊆cat cssc 17988  Subcatcsubc 17990
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-pm 8854  df-ixp 8930  df-homf 17850  df-ssc 17991  df-subc 17993
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator