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

Theorem oppccomfpropd 17894
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 2761 . . . . . 6 (Base‘𝐶) = (Base‘𝐶)
2 eqid 2761 . . . . . 6 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2761 . . . . . 6 (comp‘𝐶) = (comp‘𝐶)
4 eqid 2761 . . . . . 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 2761 . . . . . . . 8 (oppCat‘𝐶) = (oppCat‘𝐶)
142, 13oppchom 17882 . . . . . . 7 (𝑦(Hom ‘(oppCat‘𝐶))𝑧) = (𝑧(Hom ‘𝐶)𝑦)
1512, 14eleqtrdi 2871 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑔 ∈ (𝑧(Hom ‘𝐶)𝑦))
16 simprl 783 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦))
172, 13oppchom 17882 . . . . . . 7 (𝑥(Hom ‘(oppCat‘𝐶))𝑦) = (𝑦(Hom ‘𝐶)𝑥)
1816, 17eleqtrdi 2871 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥))
191, 2, 3, 4, 6, 8, 9, 10, 11, 15, 18comfeqval 17875 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
201, 3, 13, 11, 10, 9oppcco 17884 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔))
21 eqid 2761 . . . . . 6 (Base‘𝐷) = (Base‘𝐷)
22 eqid 2761 . . . . . 6 (oppCat‘𝐷) = (oppCat‘𝐷)
235homfeqbas 17863 . . . . . . . 8 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
2423ad2antrr 739 . . . . . . 7 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (Base‘𝐶) = (Base‘𝐷))
2511, 24eleqtrd 2863 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑥 ∈ (Base‘𝐷))
2610, 24eleqtrd 2863 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑦 ∈ (Base‘𝐷))
279, 24eleqtrd 2863 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑧 ∈ (Base‘𝐷))
2821, 4, 22, 25, 26, 27oppcco 17884 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
2919, 20, 283eqtr4d 2806 . . . 4 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
3029ralrimivva 3206 . . 3 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → ∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
3130ralrimivvva 3209 . 2 (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
32 eqid 2761 . . 3 (comp‘(oppCat‘𝐶)) = (comp‘(oppCat‘𝐶))
33 eqid 2761 . . 3 (comp‘(oppCat‘𝐷)) = (comp‘(oppCat‘𝐷))
34 eqid 2761 . . 3 (Hom ‘(oppCat‘𝐶)) = (Hom ‘(oppCat‘𝐶))
3513, 1oppcbas 17885 . . . 4 (Base‘𝐶) = (Base‘(oppCat‘𝐶))
3635a1i 11 . . 3 (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐶)))
3722, 21oppcbas 17885 . . . 4 (Base‘𝐷) = (Base‘(oppCat‘𝐷))
3823, 37eqtrdi 2812 . . 3 (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐷)))
395oppchomfpropd 17893 . . 3 (𝜑 → (Homf ‘(oppCat‘𝐶)) = (Homf ‘(oppCat‘𝐷)))
4032, 33, 34, 36, 38, 39comfeq 17873 . 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 1570   ∈ wcel 2145  ∀wral 3077  ⟨cop 4590  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Hom chom 17432  compcco 17433  Homf chomf 17833  compfccomf 17834  oppCatcoppc 17878
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-tpos 8236  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-sets 17335  df-slot 17353  df-ndx 17365  df-base 17381  df-hom 17445  df-cco 17446  df-homf 17837  df-comf 17838  df-oppc 17879
This theorem is used by:  yonpropd  18435  lmdpropd  50734
  Copyright terms: Public domain W3C validator