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

Theorem prf2fval 18270
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 18268 . . 3 (𝜑𝑃 = ⟨(𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩), (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩))⟩)
72fvexi 6934 . . . . 5 𝐵 ∈ V
87mptex 7260 . . . 4 (𝑥𝐵 ↦ ⟨((1st𝐹)‘𝑥), ((1st𝐺)‘𝑥)⟩) ∈ V
97, 7mpoex 8120 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩)) ∈ V
108, 9op2ndd 8041 . . 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 7466 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
1512, 13oveq12d 7466 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐹)𝑦) = (𝑋(2nd𝐹)𝑌))
1615fveq1d 6922 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐹)𝑦)‘) = ((𝑋(2nd𝐹)𝑌)‘))
1712, 13oveq12d 7466 . . . . 5 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → (𝑥(2nd𝐺)𝑦) = (𝑋(2nd𝐺)𝑌))
1817fveq1d 6922 . . . 4 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ((𝑥(2nd𝐺)𝑦)‘) = ((𝑋(2nd𝐺)𝑌)‘))
1916, 18opeq12d 4905 . . 3 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩ = ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩)
2014, 19mpteq12dv 5257 . 2 ((𝜑 ∧ (𝑥 = 𝑋𝑦 = 𝑌)) → ( ∈ (𝑥𝐻𝑦) ↦ ⟨((𝑥(2nd𝐹)𝑦)‘), ((𝑥(2nd𝐺)𝑦)‘)⟩) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
21 prf1.x . 2 (𝜑𝑋𝐵)
22 prf2.y . 2 (𝜑𝑌𝐵)
23 ovex 7481 . . . 4 (𝑋𝐻𝑌) ∈ V
2423mptex 7260 . . 3 ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V
2524a1i 11 . 2 (𝜑 → ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩) ∈ V)
2611, 20, 21, 22, 25ovmpod 7602 1 (𝜑 → (𝑋(2nd𝑃)𝑌) = ( ∈ (𝑋𝐻𝑌) ↦ ⟨((𝑋(2nd𝐹)𝑌)‘), ((𝑋(2nd𝐺)𝑌)‘)⟩))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  Vcvv 3488  cop 4654  cmpt 5249  cfv 6573  (class class class)co 7448  cmpo 7450  1st c1st 8028  2nd c2nd 8029  Basecbs 17258  Hom chom 17322   Func cfunc 17918   ⟨,⟩F cprf 18240
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-map 8886  df-ixp 8956  df-func 17922  df-prf 18244
This theorem is referenced by:  prf2  18271
  Copyright terms: Public domain W3C validator