Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isthincd Structured version   Visualization version   GIF version

Theorem isthincd 50197
Description: The predicate "is a thin category" (deduction form). (Contributed by Zhi Wang, 17-Sep-2024.)
Hypotheses
Ref Expression
isthincd.b (𝜑𝐵 = (Base‘𝐶))
isthincd.h (𝜑𝐻 = (Hom ‘𝐶))
isthincd.t ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
isthincd.c (𝜑𝐶 ∈ Cat)
Assertion
Ref Expression
isthincd (𝜑𝐶 ∈ ThinCat)
Distinct variable groups:   𝑦,𝐵   𝐶,𝑓,𝑥,𝑦   𝜑,𝑓,𝑥,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑓)   𝐻(𝑥,𝑦,𝑓)

Proof of Theorem isthincd
StepHypRef Expression
1 isthincd.c . 2 (𝜑𝐶 ∈ Cat)
2 isthincd.t . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
32ralrimivva 3208 . . 3 (𝜑 → ∀𝑥𝐵𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
4 isthincd.b . . . 4 (𝜑𝐵 = (Base‘𝐶))
5 isthincd.h . . . . . . . 8 (𝜑𝐻 = (Hom ‘𝐶))
65oveqd 7429 . . . . . . 7 (𝜑 → (𝑥𝐻𝑦) = (𝑥(Hom ‘𝐶)𝑦))
76eleq2d 2849 . . . . . 6 (𝜑 → (𝑓 ∈ (𝑥𝐻𝑦) ↔ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
87mobidv 2577 . . . . 5 (𝜑 → (∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
94, 8raleqbidv 3338 . . . 4 (𝜑 → (∀𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
104, 9raleqbidv 3338 . . 3 (𝜑 → (∀𝑥𝐵𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
113, 10mpbid 235 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))
12 eqid 2763 . . 3 (Base‘𝐶) = (Base‘𝐶)
13 eqid 2763 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
1412, 13isthinc 50180 . 2 (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
151, 11, 14sylanbrc 594 1 (𝜑𝐶 ∈ ThinCat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  ∃*wmo 2565  wral 3079  cfv 6538  (class class class)co 7412  Basecbs 17270  Hom chom 17322  Catccat 17721  ThinCatcthinc 50178
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5270
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-iota 6494  df-fv 6546  df-ov 7415  df-thinc 50179
This theorem is referenced by:  isthincd2  50198  oppcthin  50199  subthinc  50204  thincciso2  50216  indcthing  50221  discthing  50222  setcthin  50226  idfudiag1  50286  arweuthinc  50290  funcsn  50302  0fucterm  50304
  Copyright terms: Public domain W3C validator