Theorem idmon 49261

Description: An identity arrow, or an identity morphism, is a monomorphism. (Contributed by Zhi Wang, 21-Sep-2024.)

Hypotheses

Ref	Expression
idmon.b	⊢ 𝐵 = (Base‘𝐶)
idmon.h	⊢ 𝐻 = (Hom ‘𝐶)
idmon.i	⊢ 1 = (Id‘𝐶)
idmon.c	⊢ (𝜑 → 𝐶 ∈ Cat)
idmon.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
idmon.m	⊢ 𝑀 = (Mono‘𝐶)

Assertion

Ref	Expression
idmon	⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝑀𝑋))

Proof of Theorem idmon

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

Step	Hyp	Ref	Expression
1		idmon.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
2		idmon.h	. . 3 ⊢ 𝐻 = (Hom ‘𝐶)
3		idmon.i	. . 3 ⊢ 1 = (Id‘𝐶)
4		idmon.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
5		idmon.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	1, 2, 3, 4, 5	catidcl 17605	. 2 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝐻𝑋))
7	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝐶 ∈ Cat)
8		simpr1 1195	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑧 ∈ 𝐵)
9		eqid 2736	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
10	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑋 ∈ 𝐵)
11		simpr2 1196	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → 𝑔 ∈ (𝑧𝐻𝑋))
12	1, 2, 3, 7, 8, 9, 10, 11	catlid 17606	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = 𝑔)
13		simpr3 1197	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ℎ ∈ (𝑧𝐻𝑋))
14	1, 2, 3, 7, 8, 9, 10, 13	catlid 17606	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)ℎ) = ℎ)
15	12, 14	eqeq12d 2752	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ((( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)ℎ) ↔ 𝑔 = ℎ))
16	15	biimpd 229	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑔 ∈ (𝑧𝐻𝑋) ∧ ℎ ∈ (𝑧𝐻𝑋))) → ((( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)ℎ) → 𝑔 = ℎ))
17	16	ralrimivvva 3182	. 2 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)ℎ) → 𝑔 = ℎ))
18		idmon.m	. . 3 ⊢ 𝑀 = (Mono‘𝐶)
19	1, 2, 9, 18, 4, 5, 5	ismon2 17658	. 2 ⊢ (𝜑 → (( 1 ‘𝑋) ∈ (𝑋𝑀𝑋) ↔ (( 1 ‘𝑋) ∈ (𝑋𝐻𝑋) ∧ ∀𝑧 ∈ 𝐵 ∀𝑔 ∈ (𝑧𝐻𝑋)∀ℎ ∈ (𝑧𝐻𝑋)((( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)𝑔) = (( 1 ‘𝑋)(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑋)ℎ) → 𝑔 = ℎ))))
20	6, 17, 19	mpbir2and 713	1 ⊢ (𝜑 → ( 1 ‘𝑋) ∈ (𝑋𝑀𝑋))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ⟨cop 4586  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  Hom chom 17188  compcco 17189  Catccat 17587  Idccid 17588  Monocmon 17652

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-cat 17591  df-cid 17592  df-mon 17654

This theorem is referenced by: (None)