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

Theorem resfval2 17157
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 5349 . . . 4 𝐹, 𝐺⟩ ∈ V
21a1i 11 . . 3 (𝜑 → ⟨𝐹, 𝐺⟩ ∈ V)
3 resfval.d . . 3 (𝜑𝐻𝑊)
42, 3resfval 17156 . 2 (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)))⟩)
5 resfval.c . . . . 5 (𝜑𝐹𝑉)
6 resfval2.g . . . . 5 (𝜑𝐺𝑋)
7 op1stg 7695 . . . . 5 ((𝐹𝑉𝐺𝑋) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
85, 6, 7syl2anc 586 . . . 4 (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
9 resfval2.d . . . . . . 7 (𝜑𝐻 Fn (𝑆 × 𝑆))
10 fndm 6450 . . . . . . 7 (𝐻 Fn (𝑆 × 𝑆) → dom 𝐻 = (𝑆 × 𝑆))
119, 10syl 17 . . . . . 6 (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
1211dmeqd 5769 . . . . 5 (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
13 dmxpid 5795 . . . . 5 dom (𝑆 × 𝑆) = 𝑆
1412, 13syl6eq 2872 . . . 4 (𝜑 → dom dom 𝐻 = 𝑆)
158, 14reseq12d 5849 . . 3 (𝜑 → ((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻) = (𝐹𝑆))
16 op2ndg 7696 . . . . . . . 8 ((𝐹𝑉𝐺𝑋) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
175, 6, 16syl2anc 586 . . . . . . 7 (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
1817fveq1d 6667 . . . . . 6 (𝜑 → ((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) = (𝐺𝑧))
1918reseq1d 5847 . . . . 5 (𝜑 → (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)) = ((𝐺𝑧) ↾ (𝐻𝑧)))
2011, 19mpteq12dv 5144 . . . 4 (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧))) = (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺𝑧) ↾ (𝐻𝑧))))
21 fveq2 6665 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺𝑧) = (𝐺‘⟨𝑥, 𝑦⟩))
22 df-ov 7153 . . . . . . 7 (𝑥𝐺𝑦) = (𝐺‘⟨𝑥, 𝑦⟩)
2321, 22syl6eqr 2874 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺𝑧) = (𝑥𝐺𝑦))
24 fveq2 6665 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻𝑧) = (𝐻‘⟨𝑥, 𝑦⟩))
25 df-ov 7153 . . . . . . 7 (𝑥𝐻𝑦) = (𝐻‘⟨𝑥, 𝑦⟩)
2624, 25syl6eqr 2874 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻𝑧) = (𝑥𝐻𝑦))
2723, 26reseq12d 5849 . . . . 5 (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝐺𝑧) ↾ (𝐻𝑧)) = ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
2827mpompt 7260 . . . 4 (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺𝑧) ↾ (𝐻𝑧))) = (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
2920, 28syl6eq 2872 . . 3 (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧))) = (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦))))
3015, 29opeq12d 4805 . 2 (𝜑 → ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻𝑧)))⟩ = ⟨(𝐹𝑆), (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
314, 30eqtrd 2856 1 (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨(𝐹𝑆), (𝑥𝑆, 𝑦𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2110  Vcvv 3495  cop 4567  cmpt 5139   × cxp 5548  dom cdm 5550  cres 5552   Fn wfn 6345  cfv 6350  (class class class)co 7150  cmpo 7152  1st c1st 7681  2nd c2nd 7682  f cresf 17121
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-iota 6309  df-fun 6352  df-fn 6353  df-fv 6358  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7683  df-2nd 7684  df-resf 17125
This theorem is referenced by:  funcrngcsetc  44262  funcringcsetc  44299
  Copyright terms: Public domain W3C validator