Theorem setcmon 17973

Description: A monomorphism of sets is an injection. (Contributed by Mario Carneiro, 3-Jan-2017.)

Hypotheses

Ref	Expression
setcmon.c	⊢ 𝐶 = (SetCat‘𝑈)
setcmon.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
setcmon.x	⊢ (𝜑 → 𝑋 ∈ 𝑈)
setcmon.y	⊢ (𝜑 → 𝑌 ∈ 𝑈)
setcmon.h	⊢ 𝑀 = (Mono‘𝐶)

Assertion

Ref	Expression
setcmon	⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹:𝑋–1-1→𝑌))

Proof of Theorem setcmon

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

Step	Hyp	Ref	Expression
1		eqid 2736	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2736	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2736	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		setcmon.h	. . . . . 6 ⊢ 𝑀 = (Mono‘𝐶)
5		setcmon.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
6		setcmon.c	. . . . . . . 8 ⊢ 𝐶 = (SetCat‘𝑈)
7	6	setccat 17971	. . . . . . 7 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
8	5, 7	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat)
9		setcmon.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑈)
10	6, 5	setcbas 17964	. . . . . . 7 ⊢ (𝜑 → 𝑈 = (Base‘𝐶))
11	9, 10	eleqtrd 2840	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐶))
12		setcmon.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑈)
13	12, 10	eleqtrd 2840	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐶))
14	1, 2, 3, 4, 8, 11, 13	monhom 17618	. . . . 5 ⊢ (𝜑 → (𝑋𝑀𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
15	14	sselda 3944	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
16	6, 5, 2, 9, 12	elsetchom 17967	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹:𝑋⟶𝑌))
17	16	biimpa 477	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌)) → 𝐹:𝑋⟶𝑌)
18	15, 17	syldan 591	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹:𝑋⟶𝑌)
19		simprr 771	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹‘𝑥) = (𝐹‘𝑦))
20	19	sneqd 4598	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → {(𝐹‘𝑥)} = {(𝐹‘𝑦)})
21	20	xpeq2d 5663	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {(𝐹‘𝑥)}) = (𝑋 × {(𝐹‘𝑦)}))
22	18	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹:𝑋⟶𝑌)
23	22	ffnd 6669	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹 Fn 𝑋)
24		simprll 777	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑥 ∈ 𝑋)
25		fcoconst 7080	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝑋 × {(𝐹‘𝑥)}))
26	23, 24, 25	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝑋 × {(𝐹‘𝑥)}))
27		simprlr 778	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑦 ∈ 𝑋)
28		fcoconst 7080	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝐹 ∘ (𝑋 × {𝑦})) = (𝑋 × {(𝐹‘𝑦)}))
29	23, 27, 28	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑦})) = (𝑋 × {(𝐹‘𝑦)}))
30	21, 26, 29	3eqtr4d 2786	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹 ∘ (𝑋 × {𝑥})) = (𝐹 ∘ (𝑋 × {𝑦})))
31	5	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑈 ∈ 𝑉)
32	9	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑋 ∈ 𝑈)
33	12	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑌 ∈ 𝑈)
34		fconst6g 6731	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝑋 → (𝑋 × {𝑥}):𝑋⟶𝑋)
35	24, 34	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}):𝑋⟶𝑋)
36	6, 31, 3, 32, 32, 33, 35, 22	setcco 17969	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹 ∘ (𝑋 × {𝑥})))
37		fconst6g 6731	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑋 → (𝑋 × {𝑦}):𝑋⟶𝑋)
38	27, 37	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑦}):𝑋⟶𝑋)
39	6, 31, 3, 32, 32, 33, 38, 22	setcco 17969	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})) = (𝐹 ∘ (𝑋 × {𝑦})))
40	30, 36, 39	3eqtr4d 2786	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})))
41	8	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐶 ∈ Cat)
42	11	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑋 ∈ (Base‘𝐶))
43	13	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑌 ∈ (Base‘𝐶))
44		simplr 767	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝐹 ∈ (𝑋𝑀𝑌))
45	6, 31, 2, 32, 32	elsetchom 17967	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥}) ∈ (𝑋(Hom ‘𝐶)𝑋) ↔ (𝑋 × {𝑥}):𝑋⟶𝑋))
46	35, 45	mpbird 256	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}) ∈ (𝑋(Hom ‘𝐶)𝑋))
47	6, 31, 2, 32, 32	elsetchom 17967	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑦}) ∈ (𝑋(Hom ‘𝐶)𝑋) ↔ (𝑋 × {𝑦}):𝑋⟶𝑋))
48	38, 47	mpbird 256	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑦}) ∈ (𝑋(Hom ‘𝐶)𝑋))
49	1, 2, 3, 4, 41, 42, 43, 42, 44, 46, 48	moni 17619	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑥})) = (𝐹(⟨𝑋, 𝑋⟩(comp‘𝐶)𝑌)(𝑋 × {𝑦})) ↔ (𝑋 × {𝑥}) = (𝑋 × {𝑦})))
50	40, 49	mpbid 231	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → (𝑋 × {𝑥}) = (𝑋 × {𝑦}))
51	50	fveq1d 6844	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥})‘𝑥) = ((𝑋 × {𝑦})‘𝑥))
52		vex 3449	. . . . . . . 8 ⊢ 𝑥 ∈ V
53	52	fvconst2 7153	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → ((𝑋 × {𝑥})‘𝑥) = 𝑥)
54	24, 53	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑥})‘𝑥) = 𝑥)
55		vex 3449	. . . . . . . 8 ⊢ 𝑦 ∈ V
56	55	fvconst2 7153	. . . . . . 7 ⊢ (𝑥 ∈ 𝑋 → ((𝑋 × {𝑦})‘𝑥) = 𝑦)
57	24, 56	syl 17	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → ((𝑋 × {𝑦})‘𝑥) = 𝑦)
58	51, 54, 57	3eqtr3d 2784	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ ((𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) ∧ (𝐹‘𝑥) = (𝐹‘𝑦))) → 𝑥 = 𝑦)
59	58	expr 457	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
60	59	ralrimivva 3197	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
61		dff13 7202	. . 3 ⊢ (𝐹:𝑋–1-1→𝑌 ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
62	18, 60, 61	sylanbrc 583	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ (𝑋𝑀𝑌)) → 𝐹:𝑋–1-1→𝑌)
63		f1f 6738	. . . 4 ⊢ (𝐹:𝑋–1-1→𝑌 → 𝐹:𝑋⟶𝑌)
64	16	biimpar 478	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
65	63, 64	sylan2 593	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
66	10	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝑈 = (Base‘𝐶))
67	66	eleq2d 2823	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ 𝑈 ↔ 𝑧 ∈ (Base‘𝐶)))
68	5	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑈 ∈ 𝑉)
69		simprl 769	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑧 ∈ 𝑈)
70	9	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑋 ∈ 𝑈)
71	12	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑌 ∈ 𝑈)
72		simprrl 779	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋))
73	6, 68, 2, 69, 70	elsetchom 17967	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ↔ 𝑔:𝑧⟶𝑋))
74	72, 73	mpbid 231	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝑔:𝑧⟶𝑋)
75	63	ad2antlr 725	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝐹:𝑋⟶𝑌)
76	6, 68, 3, 69, 70, 71, 74, 75	setcco 17969	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹 ∘ 𝑔))
77		simprrr 780	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ℎ ∈ (𝑧(Hom ‘𝐶)𝑋))
78	6, 68, 2, 69, 70	elsetchom 17967	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (ℎ ∈ (𝑧(Hom ‘𝐶)𝑋) ↔ ℎ:𝑧⟶𝑋))
79	77, 78	mpbid 231	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ℎ:𝑧⟶𝑋)
80	6, 68, 3, 69, 70, 71, 79, 75	setcco 17969	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) = (𝐹 ∘ ℎ))
81	76, 80	eqeq12d 2752	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) ↔ (𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ)))
82		simplr 767	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → 𝐹:𝑋–1-1→𝑌)
83		cocan1 7237	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ 𝑔:𝑧⟶𝑋 ∧ ℎ:𝑧⟶𝑋) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) ↔ 𝑔 = ℎ))
84	82, 74, 79, 83	syl3anc 1371	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) ↔ 𝑔 = ℎ))
85	84	biimpd 228	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹 ∘ 𝑔) = (𝐹 ∘ ℎ) → 𝑔 = ℎ))
86	81, 85	sylbid 239	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ (𝑧 ∈ 𝑈 ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
87	86	anassrs 468	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ 𝑧 ∈ 𝑈) ∧ (𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋) ∧ ℎ ∈ (𝑧(Hom ‘𝐶)𝑋))) → ((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
88	87	ralrimivva 3197	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) ∧ 𝑧 ∈ 𝑈) → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
89	88	ex 413	. . . . 5 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ 𝑈 → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ)))
90	67, 89	sylbird 259	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝑧 ∈ (Base‘𝐶) → ∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ)))
91	90	ralrimiv 3142	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))
92	1, 2, 3, 4, 8, 11, 13	ismon2 17617	. . . 4 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
93	92	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → (𝐹 ∈ (𝑋𝑀𝑌) ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ ∀𝑧 ∈ (Base‘𝐶)∀𝑔 ∈ (𝑧(Hom ‘𝐶)𝑋)∀ℎ ∈ (𝑧(Hom ‘𝐶)𝑋)((𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)𝑔) = (𝐹(⟨𝑧, 𝑋⟩(comp‘𝐶)𝑌)ℎ) → 𝑔 = ℎ))))
94	65, 91, 93	mpbir2and 711	. 2 ⊢ ((𝜑 ∧ 𝐹:𝑋–1-1→𝑌) → 𝐹 ∈ (𝑋𝑀𝑌))
95	62, 94	impbida 799	1 ⊢ (𝜑 → (𝐹 ∈ (𝑋𝑀𝑌) ↔ 𝐹:𝑋–1-1→𝑌))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  {csn 4586  ⟨cop 4592   × cxp 5631   ∘ ccom 5637   Fn wfn 6491  ⟶wf 6492  –1-1→wf1 6493  ‘cfv 6496  (class class class)co 7357  Basecbs 17083  Hom chom 17144  compcco 17145  Catccat 17544  Monocmon 17611  SetCatcsetc 17961

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-7 12221  df-8 12222  df-9 12223  df-n0 12414  df-z 12500  df-dec 12619  df-uz 12764  df-fz 13425  df-struct 17019  df-slot 17054  df-ndx 17066  df-base 17084  df-hom 17157  df-cco 17158  df-cat 17548  df-cid 17549  df-mon 17613  df-setc 17962

This theorem is referenced by: (None)