MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  monpropd Structured version   Visualization version   GIF version

Theorem monpropd 17750
Description: If two categories have the same set of objects, morphisms, and compositions, then they have the same monomorphisms. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
monpropd.3 (𝜑 → (Homf𝐶) = (Homf𝐷))
monpropd.4 (𝜑 → (compf𝐶) = (compf𝐷))
monpropd.c (𝜑𝐶 ∈ Cat)
monpropd.d (𝜑𝐷 ∈ Cat)
Assertion
Ref Expression
monpropd (𝜑 → (Mono‘𝐶) = (Mono‘𝐷))

Proof of Theorem monpropd
Dummy variables 𝑎 𝑏 𝑐 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2735 . . . . . . . . . . . 12 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2735 . . . . . . . . . . . 12 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2735 . . . . . . . . . . . 12 (Hom ‘𝐷) = (Hom ‘𝐷)
4 monpropd.3 . . . . . . . . . . . . . 14 (𝜑 → (Homf𝐶) = (Homf𝐷))
54ad2antrr 726 . . . . . . . . . . . . 13 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (Homf𝐶) = (Homf𝐷))
65ad2antrr 726 . . . . . . . . . . . 12 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (Homf𝐶) = (Homf𝐷))
7 simpr 484 . . . . . . . . . . . 12 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → 𝑐 ∈ (Base‘𝐶))
8 simp-4r 783 . . . . . . . . . . . 12 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → 𝑎 ∈ (Base‘𝐶))
91, 2, 3, 6, 7, 8homfeqval 17709 . . . . . . . . . . 11 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (𝑐(Hom ‘𝐶)𝑎) = (𝑐(Hom ‘𝐷)𝑎))
10 eqid 2735 . . . . . . . . . . . 12 (comp‘𝐶) = (comp‘𝐶)
11 eqid 2735 . . . . . . . . . . . 12 (comp‘𝐷) = (comp‘𝐷)
124ad5antr 734 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (Homf𝐶) = (Homf𝐷))
13 monpropd.4 . . . . . . . . . . . . 13 (𝜑 → (compf𝐶) = (compf𝐷))
1413ad5antr 734 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (compf𝐶) = (compf𝐷))
15 simplr 768 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑐 ∈ (Base‘𝐶))
16 simp-5r 785 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑎 ∈ (Base‘𝐶))
17 simp-4r 783 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑏 ∈ (Base‘𝐶))
18 simpr 484 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎))
19 simpllr 775 . . . . . . . . . . . 12 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏))
201, 2, 10, 11, 12, 14, 15, 16, 17, 18, 19comfeqval 17720 . . . . . . . . . . 11 ((((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔) = (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))
219, 20mpteq12dva 5206 . . . . . . . . . 10 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) = (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)))
2221cnveqd 5855 . . . . . . . . 9 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) = (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)))
2322funeqd 6558 . . . . . . . 8 (((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) ↔ Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
2423ralbidva 3161 . . . . . . 7 ((((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) → (∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) ↔ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
2524rabbidva 3422 . . . . . 6 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
26 simplr 768 . . . . . . . 8 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → 𝑎 ∈ (Base‘𝐶))
27 simpr 484 . . . . . . . 8 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → 𝑏 ∈ (Base‘𝐶))
281, 2, 3, 5, 26, 27homfeqval 17709 . . . . . . 7 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏))
294homfeqbas 17708 . . . . . . . . 9 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
3029ad2antrr 726 . . . . . . . 8 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (Base‘𝐶) = (Base‘𝐷))
3130raleqdv 3305 . . . . . . 7 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)) ↔ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
3228, 31rabeqbidv 3434 . . . . . 6 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
3325, 32eqtrd 2770 . . . . 5 (((𝜑𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
34333impa 1109 . . . 4 ((𝜑𝑎 ∈ (Base‘𝐶) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
3534mpoeq3dva 7484 . . 3 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
36 mpoeq12 7480 . . . 4 (((Base‘𝐶) = (Base‘𝐷) ∧ (Base‘𝐶) = (Base‘𝐷)) → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
3729, 29, 36syl2anc 584 . . 3 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
3835, 37eqtrd 2770 . 2 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
39 eqid 2735 . . 3 (Mono‘𝐶) = (Mono‘𝐶)
40 monpropd.c . . 3 (𝜑𝐶 ∈ Cat)
411, 2, 10, 39, 40monfval 17745 . 2 (𝜑 → (Mono‘𝐶) = (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}))
42 eqid 2735 . . 3 (Base‘𝐷) = (Base‘𝐷)
43 eqid 2735 . . 3 (Mono‘𝐷) = (Mono‘𝐷)
44 monpropd.d . . 3 (𝜑𝐷 ∈ Cat)
4542, 3, 11, 43, 44monfval 17745 . 2 (𝜑 → (Mono‘𝐷) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
4638, 41, 453eqtr4d 2780 1 (𝜑 → (Mono‘𝐶) = (Mono‘𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wral 3051  {crab 3415  cop 4607  cmpt 5201  ccnv 5653  Fun wfun 6525  cfv 6531  (class class class)co 7405  cmpo 7407  Basecbs 17228  Hom chom 17282  compcco 17283  Catccat 17676  Homf chomf 17678  compfccomf 17679  Monocmon 17741
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7988  df-2nd 7989  df-homf 17682  df-comf 17683  df-mon 17743
This theorem is referenced by:  oppcepi  17752
  Copyright terms: Public domain W3C validator