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

Theorem oppccomfpropd 17902
Description: If two categories have the same hom-sets and composition, so do their opposites. (Contributed by Mario Carneiro, 26-Jan-2017.)
Hypotheses
Ref Expression
oppchomfpropd.1 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
oppccomfpropd.1 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
Assertion
Ref Expression
oppccomfpropd (𝜑 → (compf‘(oppCat‘𝐶)) = (compf‘(oppCat‘𝐷)))

Proof of Theorem oppccomfpropd
Dummy variables 𝑓 𝑔 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2760 . . . . . 6 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2760 . . . . . 6 (comp‘𝐶) = (comp‘𝐶)
4 eqid 2760 . . . . . 6 (comp‘𝐷) = (comp‘𝐷)
5 oppchomfpropd.1 . . . . . . 7 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
65ad2antrr 739 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (Homf ‘𝐶) = (Homf ‘𝐷))
7 oppccomfpropd.1 . . . . . . 7 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
87ad2antrr 739 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (compf‘𝐶) = (compf‘𝐷))
9 simplr3 1236 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑧 ∈ (Base‘𝐶))
10 simplr2 1235 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑦 ∈ (Base‘𝐶))
11 simplr1 1234 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑥 ∈ (Base‘𝐶))
12 simprr 785 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))
13 eqid 2760 . . . . . . . 8 (oppCat‘𝐶) = (oppCat‘𝐶)
142, 13oppchom 17890 . . . . . . 7 (𝑦(Hom ‘(oppCat‘𝐶))𝑧) = (𝑧(Hom ‘𝐶)𝑦)
1512, 14eleqtrdi 2870 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑔 ∈ (𝑧(Hom ‘𝐶)𝑦))
16 simprl 783 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦))
172, 13oppchom 17890 . . . . . . 7 (𝑥(Hom ‘(oppCat‘𝐶))𝑦) = (𝑦(Hom ‘𝐶)𝑥)
1816, 17eleqtrdi 2870 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥))
191, 2, 3, 4, 6, 8, 9, 10, 11, 15, 18comfeqval 17883 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
201, 3, 13, 11, 10, 9oppcco 17892 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔))
21 eqid 2760 . . . . . 6 (Base‘𝐷) = (Base‘𝐷)
22 eqid 2760 . . . . . 6 (oppCat‘𝐷) = (oppCat‘𝐷)
235homfeqbas 17871 . . . . . . . 8 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
2423ad2antrr 739 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (Base‘𝐶) = (Base‘𝐷))
2511, 24eleqtrd 2862 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑥 ∈ (Base‘𝐷))
2610, 24eleqtrd 2862 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑦 ∈ (Base‘𝐷))
279, 24eleqtrd 2862 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑧 ∈ (Base‘𝐷))
2821, 4, 22, 25, 26, 27oppcco 17892 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
2919, 20, 283eqtr4d 2805 . . . 4 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
3029ralrimivva 3205 . . 3 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → ∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
3130ralrimivvva 3208 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
32 eqid 2760 . . 3 (comp‘(oppCat‘𝐶)) = (comp‘(oppCat‘𝐶))
33 eqid 2760 . . 3 (comp‘(oppCat‘𝐷)) = (comp‘(oppCat‘𝐷))
34 eqid 2760 . . 3 (Hom ‘(oppCat‘𝐶)) = (Hom ‘(oppCat‘𝐶))
3513, 1oppcbas 17893 . . . 4 (Base‘𝐶) = (Base‘(oppCat‘𝐶))
3635a1i 11 . . 3 (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐶)))
3722, 21oppcbas 17893 . . . 4 (Base‘𝐷) = (Base‘(oppCat‘𝐷))
3823, 37eqtrdi 2811 . . 3 (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐷)))
395oppchomfpropd 17901 . . 3 (𝜑 → (Homf ‘(oppCat‘𝐶)) = (Homf ‘(oppCat‘𝐷)))
4032, 33, 34, 36, 38, 39comfeq 17881 . 2 (𝜑 → ((compf‘(oppCat‘𝐶)) = (compf‘(oppCat‘𝐷)) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓)))
4131, 40mpbird 260 1 (𝜑 → (compf‘(oppCat‘𝐶)) = (compf‘(oppCat‘𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ⟨cop 4589  ‘cfv 6538  (class class class)co 7420  Basecbs 17388  Hom chom 17440  compcco 17441  Homf chomf 17841  compfccomf 17842  oppCatcoppc 17886
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  ax-cnex 11257  ax-resscn 11258  ax-1cn 11259  ax-icn 11260  ax-addcl 11261  ax-addrcl 11262  ax-mulcl 11263  ax-mulrcl 11264  ax-mulcom 11265  ax-addass 11266  ax-mulass 11267  ax-distr 11268  ax-i2m1 11269  ax-1ne0 11270  ax-1rid 11271  ax-rnegex 11272  ax-rrecex 11273  ax-cnre 11274  ax-pre-lttri 11275  ax-pre-lttrn 11276  ax-pre-ltadd 11277  ax-pre-mulgt0 11278
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3062  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-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  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-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-tpos 8244  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-er 8718  df-en 8975  df-dom 8976  df-sdom 8977  df-pnf 11346  df-mnf 11347  df-xr 11348  df-ltxr 11349  df-le 11350  df-sub 11544  df-neg 11545  df-nn 12337  df-2 12406  df-3 12407  df-4 12408  df-5 12409  df-6 12410  df-7 12411  df-8 12412  df-9 12413  df-n0 12608  df-z 12695  df-dec 12816  df-sets 17343  df-slot 17361  df-ndx 17373  df-base 17389  df-hom 17453  df-cco 17454  df-homf 17845  df-comf 17846  df-oppc 17887
This theorem is used by:  yonpropd  18443  lmdpropd  50809
  Copyright terms: Public domain W3C validator