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

Theorem thincmo 50955
Description: There is at most one morphism in each hom-set. (Contributed by Zhi Wang, 21-Sep-2024.)
Hypotheses
Ref Expression
thincmo.c (𝜑 → 𝐶 ∈ ThinCat)
thincmo.x (𝜑 → 𝑋 ∈ 𝐵)
thincmo.y (𝜑 → 𝑌 ∈ 𝐵)
thincmo.b 𝐵 = (Base‘𝐶)
thincmo.h 𝐻 = (Hom ‘𝐶)
Assertion
Ref Expression
thincmo (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))
Distinct variable groups:   𝐵,𝑓   𝐶,𝑓   𝑓,𝐻   𝑓,𝑋   𝑓,𝑌   𝜑,𝑓

Proof of Theorem thincmo
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 thincmo.x . . . . . 6 (𝜑 → 𝑋 ∈ 𝐵)
21adantr 486 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝑋 ∈ 𝐵)
3 thincmo.y . . . . . 6 (𝜑 → 𝑌 ∈ 𝐵)
43adantr 486 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝑌 ∈ 𝐵)
5 simprl 783 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝑓 ∈ (𝑋𝐻𝑌))
6 simprr 785 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝑔 ∈ (𝑋𝐻𝑌))
7 thincmo.b . . . . 5 𝐵 = (Base‘𝐶)
8 thincmo.h . . . . 5 𝐻 = (Hom ‘𝐶)
9 thincmo.c . . . . . 6 (𝜑 → 𝐶 ∈ ThinCat)
109adantr 486 . . . . 5 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝐶 ∈ ThinCat)
112, 4, 5, 6, 7, 8, 10thincmo2 50953 . . . 4 ((𝜑 ∧ (𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌))) → 𝑓 = 𝑔)
1211ex 418 . . 3 (𝜑 → ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝑔))
1312alrimivv 1963 . 2 (𝜑 → ∀𝑓∀𝑔((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝑔))
14 eleq1w 2847 . . 3 (𝑓 = 𝑔 → (𝑓 ∈ (𝑋𝐻𝑌) ↔ 𝑔 ∈ (𝑋𝐻𝑌)))
1514mo4 2594 . 2 (∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ ∀𝑓∀𝑔((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑋𝐻𝑌)) → 𝑓 = 𝑔))
1613, 15sylibr 237 1 (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  ThinCatcthinc 50944
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-nul 5266
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-iota 6520  df-fv 6574  df-ov 7454  df-thinc 50945
This theorem is used by:  thincmod  50957  oppcthin  50965  subthinc  50970  functhinclem1  50971  functhinclem4  50974  thincfth  50979  thincciso2  50982
  Copyright terms: Public domain W3C validator