Theorem thincmon 50675

Description: In a thin category, all morphisms are monomorphisms. Example 7.33(9) of [Adamek] p. 110. The converse does not hold. See grptcmon 50838. (Contributed by Zhi Wang, 24-Sep-2024.)

Hypotheses

Ref	Expression
thincid.c	⊢ (𝜑 → 𝐶 ∈ ThinCat)
thincid.b	⊢ 𝐵 = (Base‘𝐶)
thincid.h	⊢ 𝐻 = (Hom ‘𝐶)
thincid.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
thincmon.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
thincmon.m	⊢ 𝑀 = (Mono‘𝐶)

Assertion

Ref	Expression
thincmon	⊢ (𝜑 → (𝑋𝑀𝑌) = (𝑋𝐻𝑌))

Proof of Theorem thincmon

Dummy variables 𝑓 𝑔 ℎ 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr1 1213	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑧 ∈ 𝐵)
2		thincid.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
3	2	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑋 ∈ 𝐵)
4		simpr2 1214	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑔 ∈ (𝑧𝐻𝑋))
5		simpr3 1215	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ℎ ∈ (𝑧𝐻𝑋))
6		thincid.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
7		thincid.h	. . . . . 6 ⊢ 𝐻 = (Hom ‘𝐶)
8		thincid.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
9	8	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝐶 ∈ ThinCat)
10	1, 3, 4, 5, 6, 7, 9	thincmo2 50668	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑔 = ℎ)
11	10	a1d 26	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
12	11	ralrimivvva 3208	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
13		eqid 2760	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
14		thincmon.m	. . . 4 ⊢ 𝑀 = (Mono‘𝐶)
15	8	thinccatd 50665	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
16		thincmon.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
17	6, 7, 13, 14, 15, 2, 16	ismon2 17916	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝑀𝑌) ↔ (𝑓 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
18	12, 17	mpbiran2d 721	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝑀𝑌) ↔ 𝑓 ∈ (𝑋𝐻𝑌)))
19	18	eqrdv 2758	1 ⊢ (𝜑 → (𝑋𝑀𝑌) = (𝑋𝐻𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟨cop 4834  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  Hom chom 17446  compcco 17447  Monocmon 17910  ThinCatcthinc 50659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-1st 8003  df-2nd 8004  df-cat 17849  df-mon 17912  df-thinc 50660

This theorem is used by: (None)