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

Theorem oppcval 17770
Description: Value of the opposite category. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
oppcval.b 𝐵 = (Base‘𝐶)
oppcval.h 𝐻 = (Hom ‘𝐶)
oppcval.x · = (comp‘𝐶)
oppcval.o 𝑂 = (oppCat‘𝐶)
Assertion
Ref Expression
oppcval (𝐶𝑉𝑂 = ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩))
Distinct variable group:   𝑧,𝑢,𝐶
Allowed substitution hints:   𝐵(𝑧,𝑢)   · (𝑧,𝑢)   𝐻(𝑧,𝑢)   𝑂(𝑧,𝑢)   𝑉(𝑧,𝑢)

Proof of Theorem oppcval
Dummy variable 𝑐 is distinct from all other variables.
StepHypRef Expression
1 oppcval.o . 2 𝑂 = (oppCat‘𝐶)
2 elex 3476 . . 3 (𝐶𝑉𝐶 ∈ V)
3 id 23 . . . . . 6 (𝑐 = 𝐶𝑐 = 𝐶)
4 fveq2 6883 . . . . . . . . 9 (𝑐 = 𝐶 → (Hom ‘𝑐) = (Hom ‘𝐶))
5 oppcval.h . . . . . . . . 9 𝐻 = (Hom ‘𝐶)
64, 5eqtr4di 2816 . . . . . . . 8 (𝑐 = 𝐶 → (Hom ‘𝑐) = 𝐻)
76tposeqd 8226 . . . . . . 7 (𝑐 = 𝐶 → tpos (Hom ‘𝑐) = tpos 𝐻)
87opeq2d 4846 . . . . . 6 (𝑐 = 𝐶 → ⟨(Hom ‘ndx), tpos (Hom ‘𝑐)⟩ = ⟨(Hom ‘ndx), tpos 𝐻⟩)
93, 8oveq12d 7430 . . . . 5 (𝑐 = 𝐶 → (𝑐 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝑐)⟩) = (𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩))
10 fveq2 6883 . . . . . . . . 9 (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
11 oppcval.b . . . . . . . . 9 𝐵 = (Base‘𝐶)
1210, 11eqtr4di 2816 . . . . . . . 8 (𝑐 = 𝐶 → (Base‘𝑐) = 𝐵)
1312sqxpeqd 5695 . . . . . . 7 (𝑐 = 𝐶 → ((Base‘𝑐) × (Base‘𝑐)) = (𝐵 × 𝐵))
14 fveq2 6883 . . . . . . . . . 10 (𝑐 = 𝐶 → (comp‘𝑐) = (comp‘𝐶))
15 oppcval.x . . . . . . . . . 10 · = (comp‘𝐶)
1614, 15eqtr4di 2816 . . . . . . . . 9 (𝑐 = 𝐶 → (comp‘𝑐) = · )
1716oveqd 7429 . . . . . . . 8 (𝑐 = 𝐶 → (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢)) = (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))
1817tposeqd 8226 . . . . . . 7 (𝑐 = 𝐶 → tpos (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢)) = tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))
1913, 12, 18mpoeq123dv 7487 . . . . . 6 (𝑐 = 𝐶 → (𝑢 ∈ ((Base‘𝑐) × (Base‘𝑐)), 𝑧 ∈ (Base‘𝑐) ↦ tpos (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢))) = (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢))))
2019opeq2d 4846 . . . . 5 (𝑐 = 𝐶 → ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝑐) × (Base‘𝑐)), 𝑧 ∈ (Base‘𝑐) ↦ tpos (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢)))⟩ = ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩)
219, 20oveq12d 7430 . . . 4 (𝑐 = 𝐶 → ((𝑐 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝑐)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝑐) × (Base‘𝑐)), 𝑧 ∈ (Base‘𝑐) ↦ tpos (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢)))⟩) = ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩))
22 df-oppc 17769 . . . 4 oppCat = (𝑐 ∈ V ↦ ((𝑐 sSet ⟨(Hom ‘ndx), tpos (Hom ‘𝑐)⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ ((Base‘𝑐) × (Base‘𝑐)), 𝑧 ∈ (Base‘𝑐) ↦ tpos (⟨𝑧, (2nd𝑢)⟩(comp‘𝑐)(1st𝑢)))⟩))
23 ovex 7445 . . . 4 ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩) ∈ V
2421, 22, 23fvmpt 6991 . . 3 (𝐶 ∈ V → (oppCat‘𝐶) = ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩))
252, 24syl 18 . 2 (𝐶𝑉 → (oppCat‘𝐶) = ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩))
261, 25eqtrid 2810 1 (𝐶𝑉𝑂 = ((𝐶 sSet ⟨(Hom ‘ndx), tpos 𝐻⟩) sSet ⟨(comp‘ndx), (𝑢 ∈ (𝐵 × 𝐵), 𝑧𝐵 ↦ tpos (⟨𝑧, (2nd𝑢)⟩ · (1st𝑢)))⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  Vcvv 3455  cop 4596   × cxp 5661  cfv 6538  (class class class)co 7412  cmpo 7414  1st c1st 7985  2nd c2nd 7986  tpos ctpos 8222   sSet csts 17224  ndxcnx 17254  Basecbs 17270  Hom chom 17322  compcco 17323  oppCatcoppc 17768
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-res 5675  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-tpos 8223  df-oppc 17769
This theorem is referenced by:  oppchomfval  17771  oppccofval  17773  oppcbas  17775  catcoppccl  18175
  Copyright terms: Public domain W3C validator