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

Theorem 0subcat 17774
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 17773 . 2 (𝐶 ∈ Cat → ∅ ⊆cat (Homf𝐶))
2 ral0 4453 . . 3 𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥𝑦)∀𝑔 ∈ (𝑦𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝑧))
32a1i 11 . 2 (𝐶 ∈ Cat → ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥𝑦)∀𝑔 ∈ (𝑦𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝑧)))
4 eqid 2737 . . 3 (Homf𝐶) = (Homf𝐶)
5 eqid 2737 . . 3 (Id‘𝐶) = (Id‘𝐶)
6 eqid 2737 . . 3 (comp‘𝐶) = (comp‘𝐶)
7 id 22 . . 3 (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8 f0 6723 . . . . . 6 ∅:∅⟶∅
9 ffn 6670 . . . . . 6 (∅:∅⟶∅ → ∅ Fn ∅)
108, 9ax-mp 5 . . . . 5 ∅ Fn ∅
11 0xp 5731 . . . . . 6 (∅ × ∅) = ∅
1211fneq2i 6598 . . . . 5 (∅ Fn (∅ × ∅) ↔ ∅ Fn ∅)
1310, 12mpbir 231 . . . 4 ∅ Fn (∅ × ∅)
1413a1i 11 . . 3 (𝐶 ∈ Cat → ∅ Fn (∅ × ∅))
154, 5, 6, 7, 14issubc2 17772 . 2 (𝐶 ∈ Cat → (∅ ∈ (Subcat‘𝐶) ↔ (∅ ⊆cat (Homf𝐶) ∧ ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥𝑦)∀𝑔 ∈ (𝑦𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥𝑧)))))
161, 3, 15mpbir2and 714 1 (𝐶 ∈ Cat → ∅ ∈ (Subcat‘𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2114  wral 3052  c0 4287  cop 4588   class class class wbr 5100   × cxp 5630   Fn wfn 6495  wf 6496  cfv 6500  (class class class)co 7368  compcco 17201  Catccat 17599  Idccid 17600  Homf chomf 17601  cat cssc 17743  Subcatcsubc 17745
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-pm 8778  df-ixp 8848  df-homf 17605  df-ssc 17746  df-subc 17748
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator