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

Theorem 0subcat 18006
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 18005 . 2 (𝐶 ∈ Cat → ∅ ⊆cat (Homf ‘𝐶))
2 ral0 4454 . . 3 ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧))
32a1i 11 . 2 (𝐶 ∈ Cat → ∀𝑥 ∈ ∅ (((Id‘𝐶)‘𝑥) ∈ (𝑥∅𝑥) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑓 ∈ (𝑥∅𝑦)∀𝑔 ∈ (𝑦∅𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) ∈ (𝑥∅𝑧)))
4 eqid 2761 . . 3 (Homf ‘𝐶) = (Homf ‘𝐶)
5 eqid 2761 . . 3 (Id‘𝐶) = (Id‘𝐶)
6 eqid 2761 . . 3 (comp‘𝐶) = (comp‘𝐶)
7 id 23 . . 3 (𝐶 ∈ Cat → 𝐶 ∈ Cat)
8 f0 6761 . . . . . 6 ∅:∅⟶∅
9 ffn 6707 . . . . . 6 (∅:∅⟶∅ → ∅ Fn ∅)
108, 9ax-mp 5 . . . . 5 ∅ Fn ∅
11 0xp 5750 . . . . . 6 (∅ × ∅) = ∅
1211fneq2i 6635 . . . . 5 (∅ Fn (∅ × ∅) ↔ ∅ Fn ∅)
1310, 12mpbir 234 . . . 4 ∅ Fn (∅ × ∅)
1413a1i 11 . . 3 (𝐶 ∈ Cat → ∅ Fn (∅ × ∅))
154, 5, 6, 7, 14issubc2 18004 . 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 2145  ∀wral 3077  ∅c0 4279  ⟨cop 4590   class class class wbr 5103   × cxp 5649   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  compcco 17433  Catccat 17831  Idccid 17832  Homf chomf 17833   ⊆cat cssc 17975  Subcatcsubc 17977
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-pm 8843  df-ixp 8919  df-homf 17837  df-ssc 17978  df-subc 17980
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator