Theorem thincmod 48698

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 2846	. . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
5		thincmo.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
6	5, 3	eleqtrd 2846	. . 3 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
7		eqid 2740	. . 3 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2740	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9	1, 4, 6, 7, 8	thincmo 48696	. 2 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌))
10		thincn0eu.h	. . . . 5 ⊢ (𝜑 → 𝐻 = (Hom ‘𝐶))
11	10	oveqd 7465	. . . 4 ⊢ (𝜑 → (𝑋𝐻𝑌) = (𝑋(Hom ‘𝐶)𝑌))
12	11	eleq2d 2830	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝐻𝑌) ↔ 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌)))
13	12	mobidv 2552	. 2 ⊢ (𝜑 → (∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌) ↔ ∃*𝑓 𝑓 ∈ (𝑋(Hom ‘𝐶)𝑌)))
14	9, 13	mpbird 257	1 ⊢ (𝜑 → ∃*𝑓 𝑓 ∈ (𝑋𝐻𝑌))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  ∃*wmo 2541  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  Hom chom 17322  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-10 2141  ax-11 2158  ax-12 2178  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-nf 1782  df-sb 2065  df-mo 2543  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  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:  thincn0eu  48699