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

Theorem prcofval 50844
Description: Value of the pre-composition functor. (Contributed by Zhi Wang, 2-Nov-2025.)
Hypotheses
Ref Expression
prcofvalg.b 𝐵 = (𝐷 Func 𝐸)
prcofvalg.n 𝑁 = (𝐷 Nat 𝐸)
prcofvala.d (𝜑 → 𝐷 ∈ 𝑉)
prcofvala.e (𝜑 → 𝐸 ∈ 𝑊)
prcofval.r Rel 𝑅
prcofval.f (𝜑 → 𝐹𝑅𝐺)
Assertion
Ref Expression
prcofval (𝜑 → (⟨𝐷, 𝐸⟩ −∘F ⟨𝐹, 𝐺⟩) = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func ⟨𝐹, 𝐺⟩)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ 𝐹)))⟩)
Distinct variable groups:   𝐵,𝑎,𝑘,𝑙   𝐷,𝑎,𝑘,𝑙   𝐸,𝑎,𝑘,𝑙   𝐹,𝑎,𝑘,𝑙   𝐺,𝑎,𝑘,𝑙   𝜑,𝑎,𝑘,𝑙
Allowed substitution hints:   𝑅(𝑘, 𝑎, 𝑙)   𝑁(𝑘, 𝑎, 𝑙)   𝑉(𝑘, 𝑎, 𝑙)   𝑊(𝑘, 𝑎, 𝑙)

Proof of Theorem prcofval
StepHypRef Expression
1 prcofvalg.b . . 3 𝐵 = (𝐷 Func 𝐸)
2 prcofvalg.n . . 3 𝑁 = (𝐷 Nat 𝐸)
3 prcofvala.d . . 3 (𝜑 → 𝐷 ∈ 𝑉)
4 prcofvala.e . . 3 (𝜑 → 𝐸 ∈ 𝑊)
5 opex 5439 . . . 4 ⟨𝐹, 𝐺⟩ ∈ V
65a1i 11 . . 3 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ V)
71, 2, 3, 4, 6prcofvala 50843 . 2 (𝜑 → (⟨𝐷, 𝐸⟩ −∘F ⟨𝐹, 𝐺⟩) = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func ⟨𝐹, 𝐺⟩)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘⟨𝐹, 𝐺⟩))))⟩)
8 prcofval.f . . . . . . 7 (𝜑 → 𝐹𝑅𝐺)
9 prcofval.r . . . . . . . 8 Rel 𝑅
109brrelex12i 5713 . . . . . . 7 (𝐹𝑅𝐺 → (𝐹 ∈ V ∧ 𝐺 ∈ V))
11 op1stg 8047 . . . . . . 7 ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
128, 10, 113syl 19 . . . . . 6 (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
1312coeq2d 5851 . . . . 5 (𝜑 → (𝑎 ∘ (1st ‘⟨𝐹, 𝐺⟩)) = (𝑎 ∘ 𝐹))
1413mpteq2dv 5205 . . . 4 (𝜑 → (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘⟨𝐹, 𝐺⟩))) = (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ 𝐹)))
1514mpoeq3dv 7530 . . 3 (𝜑 → (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘⟨𝐹, 𝐺⟩)))) = (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ 𝐹))))
1615opeq2d 4852 . 2 (𝜑 → ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func ⟨𝐹, 𝐺⟩)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘⟨𝐹, 𝐺⟩))))⟩ = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func ⟨𝐹, 𝐺⟩)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ 𝐹)))⟩)
177, 16eqtrd 2798 1 (𝜑 → (⟨𝐷, 𝐸⟩ −∘F ⟨𝐹, 𝐺⟩) = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func ⟨𝐹, 𝐺⟩)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ 𝐹)))⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   class class class wbr 5108   ↦ cmpt 5192   ∘ ccom 5662  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033   Func cfunc 18079   ∘func ccofu 18081   Nat cnat 18169   −∘F cprcof 50839
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-prcof 50840
This theorem is used by:  prcoftposcurfuco  50849  prcof2  50856
  Copyright terms: Public domain W3C validator