Theorem thincmon 50015

Description: In a thin category, all morphisms are monomorphisms. Example 7.33(9) of [Adamek] p. 110. The converse does not hold. See grptcmon 50175. (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 1207	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑧 ∈ 𝐵)
2		thincid.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
3	2	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑋 ∈ 𝐵)
4		simpr2 1208	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑔 ∈ (𝑧𝐻𝑋))
5		simpr3 1209	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ℎ ∈ (𝑧𝐻𝑋))
6		thincid.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
7		thincid.h	. . . . . 6 ⊢ 𝐻 = (Hom ‘𝐶)
8		thincid.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
9	8	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝐶 ∈ ThinCat)
10	1, 3, 4, 5, 6, 7, 9	thincmo2 50008	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑔 = ℎ)
11	10	a1d 25	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
12	11	ralrimivvva 3207	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
13		eqid 2761	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
14		thincmon.m	. . . 4 ⊢ 𝑀 = (Mono‘𝐶)
15	8	thinccd 50005	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
16		thincmon.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
17	6, 7, 13, 14, 15, 2, 16	ismon2 17758	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝑀𝑌) ↔ (𝑓 ∈ (𝑋𝐻𝑌) ∧ ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝑓(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
18	12, 17	mpbiran2d 718	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑋𝑀𝑌) ↔ 𝑓 ∈ (𝑋𝐻𝑌)))
19	18	eqrdv 2759	1 ⊢ (𝜑 → (𝑋𝑀𝑌) = (𝑋𝐻𝑌))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ⟨cop 4585  ‘cfv 6516  (class class class)co 7391  Basecbs 17236  Hom chom 17288  compcco 17289  Monocmon 17752  ThinCatcthinc 49999

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7394  df-oprab 7395  df-mpo 7396  df-1st 7965  df-2nd 7966  df-cat 17691  df-mon 17754  df-thinc 50000

This theorem is referenced by: (None)