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

Theorem prf2 16665
 Description: Value of the pairing functor on morphisms. (Contributed by Mario Carneiro, 12-Jan-2017.)
Hypotheses
Ref Expression
prfval.k 𝑃 = (𝐹 ⟨,⟩F 𝐺)
prfval.b 𝐵 = (Base‘𝐶)
prfval.h 𝐻 = (Hom ‘𝐶)
prfval.c (𝜑𝐹 ∈ (𝐶 Func 𝐷))
prfval.d (𝜑𝐺 ∈ (𝐶 Func 𝐸))
prf1.x (𝜑𝑋𝐵)
prf2.y (𝜑𝑌𝐵)
prf2.k (𝜑𝐾 ∈ (𝑋𝐻𝑌))
Assertion
Ref Expression
prf2 (𝜑 → ((𝑋(2nd𝑃)𝑌)‘𝐾) = ⟨((𝑋(2nd𝐹)𝑌)‘𝐾), ((𝑋(2nd𝐺)𝑌)‘𝐾)⟩)

Proof of Theorem prf2
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 prfval.k . . 3 𝑃 = (𝐹 ⟨,⟩F 𝐺)
2 prfval.b . . 3 𝐵 = (Base‘𝐶)
3 prfval.h . . 3 𝐻 = (Hom ‘𝐶)
4 prfval.c . . 3 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
5 prfval.d . . 3 (𝜑𝐺 ∈ (𝐶 Func 𝐸))
6 prf1.x . . 3 (𝜑𝑋𝐵)
7 prf2.y . . 3 (𝜑𝑌𝐵)
81, 2, 3, 4, 5, 6, 7prf2fval 16664 . 2 (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
9 simpr 476 . . . 4 ((𝜑 = 𝐾) → = 𝐾)
109fveq2d 6107 . . 3 ((𝜑 = 𝐾) → ((𝑋(2nd𝐹)𝑌)‘) = ((𝑋(2nd𝐹)𝑌)‘𝐾))
119fveq2d 6107 . . 3 ((𝜑 = 𝐾) → ((𝑋(2nd𝐺)𝑌)‘) = ((𝑋(2nd𝐺)𝑌)‘𝐾))
1210, 11opeq12d 4348 . 2 ((𝜑 = 𝐾) → ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩ = ⟨((𝑋(2nd𝐹)𝑌)‘𝐾), ((𝑋(2nd𝐺)𝑌)‘𝐾)⟩)
13 prf2.k . 2 (𝜑𝐾 ∈ (𝑋𝐻𝑌))
14 opex 4859 . . 3 ⟨((𝑋(2nd𝐹)𝑌)‘𝐾), ((𝑋(2nd𝐺)𝑌)‘𝐾)⟩ ∈ V
1514a1i 11 . 2 (𝜑 → ⟨((𝑋(2nd𝐹)𝑌)‘𝐾), ((𝑋(2nd𝐺)𝑌)‘𝐾)⟩ ∈ V)
168, 12, 13, 15fvmptd 6197 1 (𝜑 → ((𝑋(2nd𝑃)𝑌)‘𝐾) = ⟨((𝑋(2nd𝐹)𝑌)‘𝐾), ((𝑋(2nd𝐺)𝑌)‘𝐾)⟩)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  Vcvv 3173  ⟨cop 4131  ‘cfv 5804  (class class class)co 6549  2nd c2nd 7058  Basecbs 15695  Hom chom 15779   Func cfunc 16337   ⟨,⟩F cprf 16634 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-map 7746  df-ixp 7795  df-func 16341  df-prf 16638 This theorem is referenced by:  prfcl  16666  prf1st  16667  prf2nd  16668  uncf2  16700  yonedalem22  16741
 Copyright terms: Public domain W3C validator