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

Theorem resfval2 16376
Description: Value of the functor restriction operator. (Contributed by Mario Carneiro, 6-Jan-2017.)
Hypotheses
Ref Expression
resfval.c (𝜑𝐹𝑉)
resfval.d (𝜑𝐻𝑊)
resfval2.g (𝜑𝐺𝑋)
resfval2.d (𝜑𝐻 Fn (𝑆 × 𝑆))
Assertion
Ref Expression
resfval2 (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨(𝐹𝑆), (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
Distinct variable groups:   𝑥,𝐹   𝑥,𝑦,𝐺   𝑥,𝐻,𝑦   𝜑,𝑥   𝑥,𝑆,𝑦
Allowed substitution hints:   𝜑(𝑦)   𝐹(𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)   𝑋(𝑥,𝑦)

Proof of Theorem resfval2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 opex 4859 . . . 4 𝐹, 𝐺⟩ ∈ V
21a1i 11 . . 3 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ V)
3 resfval.d . . 3 (𝜑𝐻𝑊)
42, 3resfval 16375 . 2 (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)))⟩)
5 resfval.c . . . . 5 (𝜑𝐹𝑉)
6 resfval2.g . . . . 5 (𝜑𝐺𝑋)
7 op1stg 7071 . . . . 5 ((𝐹𝑉𝐺𝑋) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
85, 6, 7syl2anc 691 . . . 4 (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
9 resfval2.d . . . . . . 7 (𝜑𝐻 Fn (𝑆 × 𝑆))
10 fndm 5904 . . . . . . 7 (𝐻 Fn (𝑆 × 𝑆) → dom 𝐻 = (𝑆 × 𝑆))
119, 10syl 17 . . . . . 6 (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
1211dmeqd 5248 . . . . 5 (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
13 dmxpid 5266 . . . . 5 dom (𝑆 × 𝑆) = 𝑆
1412, 13syl6eq 2660 . . . 4 (𝜑 → dom dom 𝐻 = 𝑆)
158, 14reseq12d 5318 . . 3 (𝜑 → ((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻) = (𝐹𝑆))
16 op2ndg 7072 . . . . . . . 8 ((𝐹𝑉𝐺𝑋) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
175, 6, 16syl2anc 691 . . . . . . 7 (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
1817fveq1d 6105 . . . . . 6 (𝜑 → ((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) = (𝐺𝑧))
1918reseq1d 5316 . . . . 5 (𝜑 → (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)) = ((𝐺𝑧) ↾ (𝐻𝑧)))
2011, 19mpteq12dv 4663 . . . 4 (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧))) = (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺𝑧) ↾ (𝐻𝑧))))
21 fveq2 6103 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺𝑧) = (𝐺‘⟨𝑥, 𝑦⟩))
22 df-ov 6552 . . . . . . 7 (𝑥𝐺𝑦) = (𝐺‘⟨𝑥, 𝑦⟩)
2321, 22syl6eqr 2662 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺𝑧) = (𝑥𝐺𝑦))
24 fveq2 6103 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻𝑧) = (𝐻‘⟨𝑥, 𝑦⟩))
25 df-ov 6552 . . . . . . 7 (𝑥𝐻𝑦) = (𝐻‘⟨𝑥, 𝑦⟩)
2624, 25syl6eqr 2662 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻𝑧) = (𝑥𝐻𝑦))
2723, 26reseq12d 5318 . . . . 5 (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝐺𝑧) ↾ (𝐻𝑧)) = ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
2827mpt2mpt 6650 . . . 4 (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺𝑧) ↾ (𝐻𝑧))) = (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
2920, 28syl6eq 2660 . . 3 (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧))) = (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦))))
3015, 29opeq12d 4348 . 2 (𝜑 → ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)))⟩ = ⟨(𝐹𝑆), (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
314, 30eqtrd 2644 1 (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨(𝐹𝑆), (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1475  wcel 1977  Vcvv 3173  cop 4131  cmpt 4643   × cxp 5036  dom cdm 5038  cres 5040   Fn wfn 5799  cfv 5804  (class class class)co 6549  cmpt2 6551  1st c1st 7057  2nd c2nd 7058  f cresf 16340
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-resf 16344
This theorem is referenced by:  funcrngcsetc  41790  funcringcsetc  41827
  Copyright terms: Public domain W3C validator