Theorem oppff1o 49636

Description: The operation generating opposite functors is bijective. (Contributed by Zhi Wang, 17-Nov-2025.)

Hypotheses

Ref	Expression
oppff1.o	⊢ 𝑂 = (oppCat‘𝐶)
oppff1.p	⊢ 𝑃 = (oppCat‘𝐷)
oppff1o.c	⊢ (𝜑 → 𝐶 ∈ 𝑉)
oppff1o.d	⊢ (𝜑 → 𝐷 ∈ 𝑊)

Assertion

Ref	Expression
oppff1o	⊢ (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1-onto→(𝑂 Func 𝑃))

Proof of Theorem oppff1o

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oppff1.o	. . . 4 ⊢ 𝑂 = (oppCat‘𝐶)
2		oppff1.p	. . . 4 ⊢ 𝑃 = (oppCat‘𝐷)
3	1, 2	oppff1 49635	. . 3 ⊢ ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃)
4	3	a1i 11	. 2 ⊢ (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃))
5		f1f 6730	. . . 4 ⊢ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃) → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃))
6	4, 5	syl 17	. . 3 ⊢ (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃))
7		fveq2 6834	. . . . . 6 ⊢ (𝑔 = ( oppFunc ‘𝑓) → (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔) = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)))
8	7	eqeq2d 2748	. . . . 5 ⊢ (𝑔 = ( oppFunc ‘𝑓) → (𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔) ↔ 𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓))))
9		oppff1o.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
10	9	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → 𝐶 ∈ 𝑉)
11		oppff1o.d	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝑊)
12	11	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → 𝐷 ∈ 𝑊)
13		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → 𝑓 ∈ (𝑂 Func 𝑃))
14	1, 2, 10, 12, 13	2oppffunc 49633	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → ( oppFunc ‘𝑓) ∈ (𝐶 Func 𝐷))
15	14	fvresd 6854	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)) = ( oppFunc ‘( oppFunc ‘𝑓)))
16		relfunc 17820	. . . . . . 7 ⊢ Rel (𝐶 Func 𝐷)
17		eqid 2737	. . . . . . 7 ⊢ ( oppFunc ‘𝑓) = ( oppFunc ‘𝑓)
18	14, 16, 17	2oppf 49619	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → ( oppFunc ‘( oppFunc ‘𝑓)) = 𝑓)
19	15, 18	eqtr2d 2773	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → 𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)))
20	8, 14, 19	rspcedvdw 3568	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ (𝑂 Func 𝑃)) → ∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔))
21	20	ralrimiva 3130	. . 3 ⊢ (𝜑 → ∀𝑓 ∈ (𝑂 Func 𝑃)∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔))
22		dffo3 7048	. . 3 ⊢ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃) ↔ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃) ∧ ∀𝑓 ∈ (𝑂 Func 𝑃)∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔)))
23	6, 21, 22	sylanbrc 584	. 2 ⊢ (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃))
24		df-f1o 6499	. 2 ⊢ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1-onto→(𝑂 Func 𝑃) ↔ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃) ∧ ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃)))
25	4, 23, 24	sylanbrc 584	1 ⊢ (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1-onto→(𝑂 Func 𝑃))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   ↾ cres 5626  ⟶wf 6488  –1-1→wf1 6489  –onto→wfo 6490  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7360  oppCatcoppc 17668   Func cfunc 17812   oppFunc coppf 49609

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-tpos 8169  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-er 8636  df-map 8768  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-hom 17235  df-cco 17236  df-cat 17625  df-cid 17626  df-homf 17627  df-comf 17628  df-oppc 17669  df-func 17816  df-oppf 49610

This theorem is referenced by:  fucoppc  49897