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

Theorem prf2fval 18125
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 18123 . . 3 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
72fvexi 6840 . . . . 5 𝐵 ∈ V
87mptex 7163 . . . 4 (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩) ∈ V
97, 7mpoex 8021 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)) ∈ V
108, 9op2ndd 7942 . . 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 7371 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1512, 13oveq12d 7371 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐹)𝑦) = (𝑋(2nd𝐹)𝑌))
1615fveq1d 6828 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐹)𝑦)‘) = ((𝑋(2nd𝐹)𝑌)‘))
1712, 13oveq12d 7371 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐺)𝑦) = (𝑋(2nd𝐺)𝑌))
1817fveq1d 6828 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐺)𝑦)‘) = ((𝑋(2nd𝐺)𝑌)‘))
1916, 18opeq12d 4835 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩ = ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩)
2014, 19mpteq12dv 5182 . 2 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
21 prf1.x . 2 (𝜑𝑋𝐵)
22 prf2.y . 2 (𝜑𝑌𝐵)
23 ovex 7386 . . . 4 (𝑋𝐻𝑌) ∈ V
2423mptex 7163 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V
2524a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V)
2611, 20, 21, 22, 25ovmpod 7505 1 (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3438  cop 4585  cmpt 5176  cfv 6486  (class class class)co 7353  cmpo 7355  1st c1st 7929  2nd c2nd 7930  Basecbs 17138  Hom chom 17190   Func cfunc 17779   ⟨,⟩F cprf 18095
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-map 8762  df-ixp 8832  df-func 17783  df-prf 18099
This theorem is referenced by:  prf2  18126
  Copyright terms: Public domain W3C validator