Theorem oppccomfpropd 17801

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.

Step	Hyp	Ref	Expression
1		eqid 2765	. . . . . 6 ⊢ (Base‘𝐶) = (Base‘𝐶)
2		eqid 2765	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2765	. . . . . 6 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		eqid 2765	. . . . . 6 ⊢ (comp‘𝐷) = (comp‘𝐷)
5		oppchomfpropd.1	. . . . . . 7 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
6	5	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (Homf ‘𝐶) = (Homf ‘𝐷))
7		oppccomfpropd.1	. . . . . . 7 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
8	7	ad2antrr 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 2765	. . . . . . . 8 ⊢ (oppCat‘𝐶) = (oppCat‘𝐶)
14	2, 13	oppchom 17789	. . . . . . 7 ⊢ (𝑦(Hom ‘(oppCat‘𝐶))𝑧) = (𝑧(Hom ‘𝐶)𝑦)
15	12, 14	eleqtrdi 2875	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑔 ∈ (𝑧(Hom ‘𝐶)𝑦))
16		simprl 783	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦))
17	2, 13	oppchom 17789	. . . . . . 7 ⊢ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) = (𝑦(Hom ‘𝐶)𝑥)
18	16, 17	eleqtrdi 2875	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑓 ∈ (𝑦(Hom ‘𝐶)𝑥))
19	1, 2, 3, 4, 6, 8, 9, 10, 11, 15, 18	comfeqval 17782	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
20	1, 3, 13, 11, 10, 9	oppcco 17791	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐶)𝑥)𝑔))
21		eqid 2765	. . . . . 6 ⊢ (Base‘𝐷) = (Base‘𝐷)
22		eqid 2765	. . . . . 6 ⊢ (oppCat‘𝐷) = (oppCat‘𝐷)
23	5	homfeqbas 17770	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
24	23	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (Base‘𝐶) = (Base‘𝐷))
25	11, 24	eleqtrd 2867	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑥 ∈ (Base‘𝐷))
26	10, 24	eleqtrd 2867	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑦 ∈ (Base‘𝐷))
27	9, 24	eleqtrd 2867	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → 𝑧 ∈ (Base‘𝐷))
28	21, 4, 22, 25, 26, 27	oppcco 17791	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓) = (𝑓(⟨𝑧, 𝑦⟩(comp‘𝐷)𝑥)𝑔))
29	19, 20, 28	3eqtr4d 2810	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) ∧ (𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧))) → (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
30	29	ralrimivva 3210	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → ∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
31	30	ralrimivvva 3213	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓))
32		eqid 2765	. . 3 ⊢ (comp‘(oppCat‘𝐶)) = (comp‘(oppCat‘𝐶))
33		eqid 2765	. . 3 ⊢ (comp‘(oppCat‘𝐷)) = (comp‘(oppCat‘𝐷))
34		eqid 2765	. . 3 ⊢ (Hom ‘(oppCat‘𝐶)) = (Hom ‘(oppCat‘𝐶))
35	13, 1	oppcbas 17792	. . . 4 ⊢ (Base‘𝐶) = (Base‘(oppCat‘𝐶))
36	35	a1i 11	. . 3 ⊢ (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐶)))
37	22, 21	oppcbas 17792	. . . 4 ⊢ (Base‘𝐷) = (Base‘(oppCat‘𝐷))
38	23, 37	eqtrdi 2816	. . 3 ⊢ (𝜑 → (Base‘𝐶) = (Base‘(oppCat‘𝐷)))
39	5	oppchomfpropd 17800	. . 3 ⊢ (𝜑 → (Homf ‘(oppCat‘𝐶)) = (Homf ‘(oppCat‘𝐷)))
40	32, 33, 34, 36, 38, 39	comfeq 17780	. 2 ⊢ (𝜑 → ((compf‘(oppCat‘𝐶)) = (compf‘(oppCat‘𝐷)) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘(oppCat‘𝐶))𝑦)∀𝑔 ∈ (𝑦(Hom ‘(oppCat‘𝐶))𝑧)(𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐶))𝑧)𝑓) = (𝑔(⟨𝑥, 𝑦⟩(comp‘(oppCat‘𝐷))𝑧)𝑓)))
41	31, 40	mpbird 260	1 ⊢ (𝜑 → (compf‘(oppCat‘𝐶)) = (compf‘(oppCat‘𝐷)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ⟨cop 4597  ‘cfv 6540  (class class class)co 7416  Basecbs 17287  Hom chom 17339  compcco 17340  Hom_f chomf 17740  comp_fccomf 17741  oppCatcoppc 17785

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-tpos 8224  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-nn 12245  df-2 12314  df-3 12315  df-4 12316  df-5 12317  df-6 12318  df-7 12319  df-8 12320  df-9 12321  df-n0 12516  df-z 12603  df-dec 12724  df-sets 17242  df-slot 17260  df-ndx 17272  df-base 17288  df-hom 17352  df-cco 17353  df-homf 17744  df-comf 17745  df-oppc 17786

This theorem is used by:  yonpropd  18342  lmdpropd  50468