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

Theorem prf2fval 18165
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 18163 . . 3 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
72fvexi 6848 . . . . 5 𝐵 ∈ V
87mptex 7174 . . . 4 (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩) ∈ V
97, 7mpoex 8028 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)) ∈ V
108, 9op2ndd 7949 . . 3 (𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩ → (2nd𝑃) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
116, 10syl 17 . 2 (𝜑 → (2nd𝑃) = (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)))
12 simprl 776 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → 𝑥 = 𝑋)
13 simprr 778 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → 𝑦 = 𝑌)
1412, 13oveq12d 7381 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1512, 13oveq12d 7381 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐹)𝑦) = (𝑋(2nd𝐹)𝑌))
1615fveq1d 6836 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐹)𝑦)‘) = ((𝑋(2nd𝐹)𝑌)‘))
1712, 13oveq12d 7381 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐺)𝑦) = (𝑋(2nd𝐺)𝑌))
1817fveq1d 6836 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐺)𝑦)‘) = ((𝑋(2nd𝐺)𝑌)‘))
1916, 18opeq12d 4819 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩ = ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩)
2014, 19mpteq12dv 5166 . 2 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
21 prf1.x . 2 (𝜑𝑋𝐵)
22 prf2.y . 2 (𝜑𝑌𝐵)
23 ovex 7396 . . . 4 (𝑋𝐻𝑌) ∈ V
2423mptex 7174 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V
2524a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V)
2611, 20, 21, 22, 25ovmpod 7515 1 (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3432  cop 4568  cmpt 5160  cfv 6492  (class class class)co 7363  cmpo 7365  1st c1st 7936  2nd c2nd 7937  Basecbs 17177  Hom chom 17229   Func cfunc 17819   ⟨,⟩F cprf 18135
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-map 8772  df-ixp 8843  df-func 17823  df-prf 18139
This theorem is referenced by:  prf2  18166
  Copyright terms: Public domain W3C validator