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 50021
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 3204 . . 3 (𝜑 → ∀𝑥𝐵𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
4 isthincd.b . . . 4 (𝜑𝐵 = (Base‘𝐶))
5 isthincd.h . . . . . . . 8 (𝜑𝐻 = (Hom ‘𝐶))
65oveqd 7409 . . . . . . 7 (𝜑 → (𝑥𝐻𝑦) = (𝑥(Hom ‘𝐶)𝑦))
76eleq2d 2847 . . . . . 6 (𝜑 → (𝑓 ∈ (𝑥𝐻𝑦) ↔ 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
87mobidv 2575 . . . . 5 (𝜑 → (∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
94, 8raleqbidv 3335 . . . 4 (𝜑 → (∀𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
104, 9raleqbidv 3335 . . 3 (𝜑 → (∀𝑥𝐵𝑦𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
113, 10mpbid 234 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦))
12 eqid 2761 . . 3 (Base‘𝐶) = (Base‘𝐶)
13 eqid 2761 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
1412, 13isthinc 50004 . 2 (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
151, 11, 14sylanbrc 592 1 (𝜑𝐶 ∈ ThinCat)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  ∃*wmo 2563  wral 3075  cfv 6517  (class class class)co 7392  Basecbs 17228  Hom chom 17280  Catccat 17679  ThinCatcthinc 50002
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-nul 5255
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-mo 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-iota 6473  df-fv 6525  df-ov 7395  df-thinc 50003
This theorem is referenced by:  isthincd2  50022  oppcthin  50023  subthinc  50028  thincciso2  50040  indcthing  50045  discthing  50046  setcthin  50050  idfudiag1  50110  arweuthinc  50114  funcsn  50126  0fucterm  50128
  Copyright terms: Public domain W3C validator