Theorem thincmod 50896

Description: At most one morphism in each hom-set (deduction form). (Contributed by Zhi Wang, 21-Sep-2024.)

Hypotheses

Ref	Expression
thincmo.c	⊢ (𝜑 → 𝐶 ∈ ThinCat)
thincmo.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
thincmo.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
thincn0eu.b	⊢ (𝜑 → 𝐵 = (Base‘𝐶))
thincn0eu.h	⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))

Assertion

Ref	Expression
thincmod	⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))

Distinct variable groups:   𝐵,𝑓   𝐶,𝑓   𝑓,𝐻   𝑓,𝑋   𝑓,𝑌   𝜑,𝑓

Proof of Theorem thincmod

Step	Hyp	Ref	Expression
1		thincmo.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
2		thincmo.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
3		thincn0eu.b	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐶))
4	2, 3	eleqtrd 2866	. . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
5		thincmo.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
6	5, 3	eleqtrd 2866	. . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
7		eqid 2763	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2763	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9	1, 4, 6, 7, 8	thincmo 50894	. 2 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌))
10		thincn0eu.h	. . . . 5 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))
11	10	oveqd 7468	. . . 4 ⊢ (𝜑 → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝐶)𝑌))
12	11	eleq2d 2850	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝐻𝑌) ↔ 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌)))
13	12	mobidv 2577	. 2 ⊢ (𝜑 → (∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ ∃*𝑓 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌)))
14	9, 13	mpbird 260	1 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  ThinCatcthinc 50883

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 50884

This theorem is used by:  thincn0eu  50897