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 50786
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 3209 . . 3 (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃*𝑓 𝑓 ∈ (𝑥𝐻𝑦))
4 isthincd.b . . . 4 (𝜑 → 𝐵 = (Base‘𝐶))
5 isthincd.h . . . . . . . 8 (𝜑 → 𝐻 = (Hom ‘𝐶))
65oveqd 7463 . . . . . . 7 (𝜑 → (𝑥𝐻𝑦) = (𝑥(Hom ‘𝐶)𝑦))
76eleq2d 2850 . . . . . 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 50769 . 2 (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
151, 11, 14sylanbrc 595 1 (𝜑 → 𝐶 ∈ ThinCat)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  ∀wral 3080  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  Hom chom 17471  Catccat 17870  ThinCatcthinc 50767
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5264
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-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-ov 7449  df-thinc 50768
This theorem is used by:  isthincd2  50787  oppcthin  50788  subthinc  50793  thincciso2  50805  indcthing  50810  discthing  50811  setcthin  50815  idfudiag1  50875  arweuthinc  50879  funcsn  50894  0fucterm  50896
  Copyright terms: Public domain W3C validator