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 48704
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 7465 . . . . . . 7 (𝜑 → (𝑥𝐻𝑦) = (𝑥(Hom ‘𝐶)𝑦))
76eleq2d 2830 . . . . . 6 (𝜑 → (𝑓 ∈ (𝑥𝐻𝑦) ↔ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
87mobidv 2552 . . . . 5 (𝜑 → (∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
94, 8raleqbidv 3354 . . . 4 (𝜑 → (∀𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
104, 9raleqbidv 3354 . . 3 (𝜑 → (∀𝑥𝐵𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
113, 10mpbid 232 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))
12 eqid 2740 . . 3 (Base‘𝐶) = (Base‘𝐶)
13 eqid 2740 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
1412, 13isthinc 48688 . 2 (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
151, 11, 14sylanbrc 582 1 (𝜑𝐶 ∈ ThinCat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  ∃*wmo 2541  wral 3067  cfv 6573  (class class class)co 7448  Basecbs 17258  Hom chom 17322  Catccat 17722  ThinCatcthinc 48686
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-nul 5324
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-mo 2543  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581  df-ov 7451  df-thinc 48687
This theorem is referenced by:  isthincd2  48705  oppcthin  48706  subthinc  48707  setcthin  48722
  Copyright terms: Public domain W3C validator