Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oppff1o Structured version   Visualization version   GIF version

Theorem oppff1o 49778
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.
StepHypRef Expression
1 oppff1.o . . . 4 𝑂 = (oppCat‘𝐶)
2 oppff1.p . . . 4 𝑃 = (oppCat‘𝐷)
31, 2oppff1 49777 . . 3 ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃)
43a1i 11 . 2 (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃))
5 f1f 6764 . . . 4 (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃) → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃))
64, 5syl 18 . . 3 (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃))
7 fveq2 6871 . . . . . 6 (𝑔 = ( oppFunc ‘𝑓) → (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔) = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)))
87eqeq2d 2776 . . . . 5 (𝑔 = ( oppFunc ‘𝑓) → (𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔) ↔ 𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓))))
9 oppff1o.c . . . . . . 7 (𝜑𝐶𝑉)
109adantr 485 . . . . . 6 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → 𝐶𝑉)
11 oppff1o.d . . . . . . 7 (𝜑𝐷𝑊)
1211adantr 485 . . . . . 6 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → 𝐷𝑊)
13 simpr 489 . . . . . 6 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → 𝑓 ∈ (𝑂 Func 𝑃))
141, 2, 10, 12, 132oppffunc 49775 . . . . 5 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → ( oppFunc ‘𝑓) ∈ (𝐶 Func 𝐷))
1514fvresd 6891 . . . . . 6 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)) = ( oppFunc ‘( oppFunc ‘𝑓)))
16 relfunc 17909 . . . . . . 7 Rel (𝐶 Func 𝐷)
17 eqid 2765 . . . . . . 7 ( oppFunc ‘𝑓) = ( oppFunc ‘𝑓)
1814, 16, 172oppf 49761 . . . . . 6 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → ( oppFunc ‘( oppFunc ‘𝑓)) = 𝑓)
1915, 18eqtr2d 2801 . . . . 5 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → 𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘( oppFunc ‘𝑓)))
208, 14, 19rspcedvdw 3587 . . . 4 ((𝜑𝑓 ∈ (𝑂 Func 𝑃)) → ∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔))
2120ralrimiva 3157 . . 3 (𝜑 → ∀𝑓 ∈ (𝑂 Func 𝑃)∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔))
22 dffo3 7087 . . 3 (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃) ↔ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)⟶(𝑂 Func 𝑃) ∧ ∀𝑓 ∈ (𝑂 Func 𝑃)∃𝑔 ∈ (𝐶 Func 𝐷)𝑓 = (( oppFunc ↾ (𝐶 Func 𝐷))‘𝑔)))
236, 21, 22sylanbrc 594 . 2 (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃))
24 df-f1o 6532 . 2 (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1-onto→(𝑂 Func 𝑃) ↔ (( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1→(𝑂 Func 𝑃) ∧ ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–onto→(𝑂 Func 𝑃)))
254, 23, 24sylanbrc 594 1 (𝜑 → ( oppFunc ↾ (𝐶 Func 𝐷)):(𝐶 Func 𝐷)–1-1-onto→(𝑂 Func 𝑃))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wral 3079  wrex 3089  cres 5654  wf 6521  1-1wf1 6522  ontowfo 6523  1-1-ontowf1o 6524  cfv 6525  (class class class)co 7400  oppCatcoppc 17757   Func cfunc 17901   oppFunc coppf 49751
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-tpos 8210  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-map 8814  df-ixp 8884  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-nn 12225  df-2 12294  df-3 12295  df-4 12296  df-5 12297  df-6 12298  df-7 12299  df-8 12300  df-9 12301  df-n0 12496  df-z 12583  df-dec 12703  df-sets 17214  df-slot 17232  df-ndx 17244  df-base 17260  df-hom 17324  df-cco 17325  df-cat 17714  df-cid 17715  df-homf 17716  df-comf 17717  df-oppc 17758  df-func 17905  df-oppf 49752
This theorem is referenced by:  fucoppc  50039
  Copyright terms: Public domain W3C validator