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

Theorem comfeqd 17741
Description: Condition for two categories with the same hom-sets to have the same composition. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
comfeqd.1 (𝜑 → (comp‘𝐶) = (comp‘𝐷))
comfeqd.2 (𝜑 → (Homf𝐶) = (Homf𝐷))
Assertion
Ref Expression
comfeqd (𝜑 → (compf𝐶) = (compf𝐷))

Proof of Theorem comfeqd
Dummy variables 𝑓 𝑔 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 comfeqd.1 . . . . . . . . 9 (𝜑 → (comp‘𝐶) = (comp‘𝐷))
21oveqd 7415 . . . . . . . 8 (𝜑 → (⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧) = (⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧))
32oveqd 7415 . . . . . . 7 (𝜑 → (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
43ralrimivw 3160 . . . . . 6 (𝜑 → ∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
54ralrimivw 3160 . . . . 5 (𝜑 → ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
65ralrimivw 3160 . . . 4 (𝜑 → ∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
76ralrimivw 3160 . . 3 (𝜑 → ∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
87ralrimivw 3160 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓))
9 eqid 2764 . . 3 (comp‘𝐶) = (comp‘𝐶)
10 eqid 2764 . . 3 (comp‘𝐷) = (comp‘𝐷)
11 eqid 2764 . . 3 (Hom ‘𝐶) = (Hom ‘𝐶)
12 eqidd 2765 . . 3 (𝜑 → (Base‘𝐶) = (Base‘𝐶))
13 comfeqd.2 . . . 4 (𝜑 → (Homf𝐶) = (Homf𝐷))
1413homfeqbas 17730 . . 3 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
159, 10, 11, 12, 14, 13comfeq 17740 . 2 (𝜑 → ((compf𝐶) = (compf𝐷) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐷)𝑧)𝑓)))
168, 15mpbird 259 1 (𝜑 → (compf𝐶) = (compf𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1562  wral 3078  cop 4590  cfv 6523  (class class class)co 7398  Basecbs 17247  Hom chom 17299  compcco 17300  Homf chomf 17700  compfccomf 17701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-ov 7401  df-oprab 7402  df-mpo 7403  df-1st 7972  df-2nd 7973  df-homf 17704  df-comf 17705
This theorem is referenced by:  fullresc  17886
  Copyright terms: Public domain W3C validator