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

Theorem prcofelvv 50907
Description: The pre-composition functor is an ordered pair. (Contributed by Zhi Wang, 4-Nov-2025.)
Hypotheses
Ref Expression
prcofelvv.f (𝜑 → 𝐹 ∈ 𝑈)
prcofelvv.p (𝜑 → 𝑃 ∈ 𝑉)
Assertion
Ref Expression
prcofelvv (𝜑 → (𝑃 −∘F 𝐹) ∈ (V × V))

Proof of Theorem prcofelvv
Dummy variables 𝑎 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . 3 ((1st ‘𝑃) Func (2nd ‘𝑃)) = ((1st ‘𝑃) Func (2nd ‘𝑃))
2 eqid 2763 . . 3 ((1st ‘𝑃) Nat (2nd ‘𝑃)) = ((1st ‘𝑃) Nat (2nd ‘𝑃))
3 prcofelvv.f . . 3 (𝜑 → 𝐹 ∈ 𝑈)
4 prcofelvv.p . . 3 (𝜑 → 𝑃 ∈ 𝑉)
5 eqidd 2764 . . 3 (𝜑 → (1st ‘𝑃) = (1st ‘𝑃))
6 eqidd 2764 . . 3 (𝜑 → (2nd ‘𝑃) = (2nd ‘𝑃))
71, 2, 3, 4, 5, 6prcofvalg 50903 . 2 (𝜑 → (𝑃 −∘F 𝐹) = ⟨(𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
8 ovex 7484 . . . 4 ((1st ‘𝑃) Func (2nd ‘𝑃)) ∈ V
98mptex 7260 . . 3 (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)) ∈ V
108, 8mpoex 8127 . . 3 (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹)))) ∈ V
119, 10opelvv 5698 . 2 ⟨(𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ ∈ (V × V)
127, 11eqeltrdi 2872 1 (𝜑 → (𝑃 −∘F 𝐹) ∈ (V × V))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   ↦ cmpt 5192   × cxp 5656   ∘ ccom 5662  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034   Func cfunc 18079   ∘func ccofu 18081   Nat cnat 18169   −∘F cprcof 50900
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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  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-reu 3370  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-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  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-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-prcof 50901
This theorem is used by:  relran  51199  ranval3  51206  ranrcl4lem  51213  ranup  51217
  Copyright terms: Public domain W3C validator