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

Theorem prf2 18402
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 18401 . 2 (𝜑 → (𝑋(2nd ‘𝑃)𝑌) = (ℎ ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd ‘𝐹)𝑌)‘ℎ), ((𝑋(2nd ‘𝐺)𝑌)‘ℎ)⟩))
9 simpr 490 . . . 4 ((𝜑 ∧ ℎ = 𝐾) → ℎ = 𝐾)
109fveq2d 6909 . . 3 ((𝜑 ∧ ℎ = 𝐾) → ((𝑋(2nd ‘𝐹)𝑌)‘ℎ) = ((𝑋(2nd ‘𝐹)𝑌)‘𝐾))
119fveq2d 6909 . . 3 ((𝜑 ∧ ℎ = 𝐾) → ((𝑋(2nd ‘𝐺)𝑌)‘ℎ) = ((𝑋(2nd ‘𝐺)𝑌)‘𝐾))
1210, 11opeq12d 4851 . 2 ((𝜑 ∧ ℎ = 𝐾) → ⟨((𝑋(2nd ‘𝐹)𝑌)‘ℎ), ((𝑋(2nd ‘𝐺)𝑌)‘ℎ)⟩ = ⟨((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)⟩)
13 prf2.k . 2 (𝜑 → 𝐾 ∈ (𝑋𝐻𝑌))
14 opex 5436 . . 3 ⟨((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)⟩ ∈ V
1514a1i 11 . 2 (𝜑 → ⟨((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)⟩ ∈ V)
168, 12, 13, 15fvmptd 7021 1 (𝜑 → ((𝑋(2nd ‘𝑃)𝑌)‘𝐾) = ⟨((𝑋(2nd ‘𝐹)𝑌)‘𝐾), ((𝑋(2nd ‘𝐺)𝑌)‘𝐾)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4838  ‘cfv 6555  (class class class)co 7440  2nd c2nd 8021  Basecbs 17413  Hom chom 17465   Func cfunc 18055   ⟨,⟩F cprf 18371
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-map 8874  df-ixp 8951  df-func 18059  df-prf 18375
This theorem is used by:  prfcl  18403  prf1st  18404  prf2nd  18405  uncf2  18437  yonedalem22  18478
  Copyright terms: Public domain W3C validator