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

Theorem monpropd 17917
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 2760 . . . . . . . . . . . 12 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2760 . . . . . . . . . . . 12 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2760 . . . . . . . . . . . 12 (Hom ‘𝐷) = (Hom ‘𝐷)
4 monpropd.3 . . . . . . . . . . . . . 14 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
54ad2antrr 739 . . . . . . . . . . . . 13 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (Homf ‘𝐶) = (Homf ‘𝐷))
65ad2antrr 739 . . . . . . . . . . . 12 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (Homf ‘𝐶) = (Homf ‘𝐷))
7 simpr 490 . . . . . . . . . . . 12 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → 𝑐 ∈ (Base‘𝐶))
8 simp-4r 796 . . . . . . . . . . . 12 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → 𝑎 ∈ (Base‘𝐶))
91, 2, 3, 6, 7, 8homfeqval 17876 . . . . . . . . . . 11 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (𝑐(Hom ‘𝐶)𝑎) = (𝑐(Hom ‘𝐷)𝑎))
10 eqid 2760 . . . . . . . . . . . 12 (comp‘𝐶) = (comp‘𝐶)
11 eqid 2760 . . . . . . . . . . . 12 (comp‘𝐷) = (comp‘𝐷)
124ad5antr 747 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (Homf ‘𝐶) = (Homf ‘𝐷))
13 monpropd.4 . . . . . . . . . . . . 13 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
1413ad5antr 747 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (compf‘𝐶) = (compf‘𝐷))
15 simplr 781 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑐 ∈ (Base‘𝐶))
16 simp-5r 798 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑎 ∈ (Base‘𝐶))
17 simp-4r 796 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑏 ∈ (Base‘𝐶))
18 simpr 490 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎))
19 simpllr 788 . . . . . . . . . . . 12 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏))
201, 2, 10, 11, 12, 14, 15, 16, 17, 18, 19comfeqval 17887 . . . . . . . . . . 11 ((((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) ∧ 𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎)) → (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔) = (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))
219, 20mpteq12dva 5190 . . . . . . . . . 10 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) = (𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)))
2221cnveqd 5852 . . . . . . . . 9 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) = ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)))
2322funeqd 6561 . . . . . . . 8 (((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) ∧ 𝑐 ∈ (Base‘𝐶)) → (Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) ↔ Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
2423ralbidva 3183 . . . . . . 7 ((((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) ∧ 𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏)) → (∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔)) ↔ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
2524rabbidva 3418 . . . . . 6 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
26 simplr 781 . . . . . . . 8 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → 𝑎 ∈ (Base‘𝐶))
27 simpr 490 . . . . . . . 8 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → 𝑏 ∈ (Base‘𝐶))
281, 2, 3, 5, 26, 27homfeqval 17876 . . . . . . 7 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏))
294homfeqbas 17875 . . . . . . . . 9 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
3029ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (Base‘𝐶) = (Base‘𝐷))
3130raleqdv 3319 . . . . . . 7 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔)) ↔ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))))
3228, 31rabeqbidv 3429 . . . . . 6 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
3325, 32eqtrd 2795 . . . . 5 (((𝜑 ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
34333impa 1127 . . . 4 ((𝜑 ∧ 𝑎 ∈ (Base‘𝐶) ∧ 𝑏 ∈ (Base‘𝐶)) → {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))} = {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))})
3534mpoeq3dva 7497 . . 3 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
36 mpoeq12 7493 . . . 4 (((Base‘𝐶) = (Base‘𝐷) ∧ (Base‘𝐶) = (Base‘𝐷)) → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
3729, 29, 36syl2anc 596 . . 3 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
3835, 37eqtrd 2795 . 2 (𝜑 → (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
39 eqid 2760 . . 3 (Mono‘𝐶) = (Mono‘𝐶)
40 monpropd.c . . 3 (𝜑 → 𝐶 ∈ Cat)
411, 2, 10, 39, 40monfval 17912 . 2 (𝜑 → (Mono‘𝐶) = (𝑎 ∈ (Base‘𝐶), 𝑏 ∈ (Base‘𝐶) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐶)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐶)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐶)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐶)𝑏)𝑔))}))
42 eqid 2760 . . 3 (Base‘𝐷) = (Base‘𝐷)
43 eqid 2760 . . 3 (Mono‘𝐷) = (Mono‘𝐷)
44 monpropd.d . . 3 (𝜑 → 𝐷 ∈ Cat)
4542, 3, 11, 43, 44monfval 17912 . 2 (𝜑 → (Mono‘𝐷) = (𝑎 ∈ (Base‘𝐷), 𝑏 ∈ (Base‘𝐷) ↦ {𝑓 ∈ (𝑎(Hom ‘𝐷)𝑏) ∣ ∀𝑐 ∈ (Base‘𝐷)Fun ◡(𝑔 ∈ (𝑐(Hom ‘𝐷)𝑎) ↦ (𝑓(⟨𝑐, 𝑎⟩(comp‘𝐷)𝑏)𝑔))}))
4638, 41, 453eqtr4d 2805 1 (𝜑 → (Mono‘𝐶) = (Mono‘𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  ⟨cop 4834   ↦ cmpt 5185  ◡ccnv 5649  Fun wfun 6532  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17392  Hom chom 17444  compcco 17445  Catccat 17843  Homf chomf 17845  compfccomf 17846  Monocmon 17908
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 7751
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 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-homf 17849  df-comf 17850  df-mon 17910
This theorem is used by:  oppcepi  17919
  Copyright terms: Public domain W3C validator