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

Theorem prf2fval 18104
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 (𝜑𝑌𝐵)
Assertion
Ref Expression
prf2fval (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
Distinct variable groups:   𝐵,   ,𝐹   𝜑,   ,𝐺   ,𝑋   ,𝑌   ,𝐻
Allowed substitution hints:   𝐶()   𝐷()   𝑃()   𝐸()

Proof of Theorem prf2fval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prfval.k . . . 4 𝑃 = (𝐹 ⟨,⟩F 𝐺)
2 prfval.b . . . 4 𝐵 = (Base‘𝐶)
3 prfval.h . . . 4 𝐻 = (Hom ‘𝐶)
4 prfval.c . . . 4 (𝜑𝐹 ∈ (𝐶 Func 𝐷))
5 prfval.d . . . 4 (𝜑𝐺 ∈ (𝐶 Func 𝐸))
61, 2, 3, 4, 5prfval 18102 . . 3 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
72fvexi 6836 . . . . 5 𝐵 ∈ V
87mptex 7157 . . . 4 (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩) ∈ V
97, 7mpoex 8011 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)) ∈ V
108, 9op2ndd 7932 . . 3 (𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ → (2nd𝑃) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
116, 10syl 17 . 2 (𝜑 → (2nd𝑃) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
12 simprl 770 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → 𝑥 = 𝑋)
13 simprr 772 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → 𝑦 = 𝑌)
1412, 13oveq12d 7364 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1512, 13oveq12d 7364 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐹)𝑦) = (𝑋(2nd𝐹)𝑌))
1615fveq1d 6824 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐹)𝑦)‘) = ((𝑋(2nd𝐹)𝑌)‘))
1712, 13oveq12d 7364 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐺)𝑦) = (𝑋(2nd𝐺)𝑌))
1817fveq1d 6824 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐺)𝑦)‘) = ((𝑋(2nd𝐺)𝑌)‘))
1916, 18opeq12d 4833 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩ = ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩)
2014, 19mpteq12dv 5178 . 2 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
21 prf1.x . 2 (𝜑𝑋𝐵)
22 prf2.y . 2 (𝜑𝑌𝐵)
23 ovex 7379 . . . 4 (𝑋𝐻𝑌) ∈ V
2423mptex 7157 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V
2524a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V)
2611, 20, 21, 22, 25ovmpod 7498 1 (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  Vcvv 3436  cop 4582  cmpt 5172  cfv 6481  (class class class)co 7346  cmpo 7348  1st c1st 7919  2nd c2nd 7920  Basecbs 17117  Hom chom 17169   Func cfunc 17758   ⟨,⟩F cprf 18074
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-map 8752  df-ixp 8822  df-func 17762  df-prf 18078
This theorem is referenced by:  prf2  18105
  Copyright terms: Public domain W3C validator