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

Theorem rescval 17982
Description: Value of the category restriction. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypothesis
Ref Expression
rescval.1 𝐷 = (𝐶 ↾cat 𝐻)
Assertion
Ref Expression
rescval ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩))

Proof of Theorem rescval
Dummy variables ℎ 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rescval.1 . 2 𝐷 = (𝐶 ↾cat 𝐻)
2 elex 3472 . . 3 (𝐶 ∈ 𝑉 → 𝐶 ∈ V)
3 elex 3472 . . 3 (𝐻 ∈ 𝑊 → 𝐻 ∈ V)
4 simpl 488 . . . . . 6 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 𝑐 = 𝐶)
5 simpr 490 . . . . . . . 8 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ℎ = 𝐻)
65dmeqd 5887 . . . . . . 7 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom ℎ = dom 𝐻)
76dmeqd 5887 . . . . . 6 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom dom ℎ = dom dom 𝐻)
84, 7oveq12d 7430 . . . . 5 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → (𝑐 ↾s dom dom ℎ) = (𝐶 ↾s dom dom 𝐻))
95opeq2d 4840 . . . . 5 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ⟨(Hom ‘ndx), ℎ⟩ = ⟨(Hom ‘ndx), 𝐻⟩)
108, 9oveq12d 7430 . . . 4 ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ((𝑐 ↾s dom dom ℎ) sSet ⟨(Hom ‘ndx), ℎ⟩) = ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩))
11 df-resc 17966 . . . 4 ↾cat = (𝑐 ∈ V, ℎ ∈ V ↦ ((𝑐 ↾s dom dom ℎ) sSet ⟨(Hom ‘ndx), ℎ⟩))
12 ovex 7445 . . . 4 ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩) ∈ V
1310, 11, 12ovmpoa 7567 . . 3 ((𝐶 ∈ V ∧ 𝐻 ∈ V) → (𝐶 ↾cat 𝐻) = ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩))
142, 3, 13syl2an 608 . 2 ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → (𝐶 ↾cat 𝐻) = ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩))
151, 14eqtrid 2808 1 ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet ⟨(Hom ‘ndx), 𝐻⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590  dom cdm 5651  ‘cfv 6531  (class class class)co 7412   sSet csts 17321  ndxcnx 17351   ↾s cress 17388  Hom chom 17419   ↾cat cresc 17963
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-resc 17966
This theorem is used by:  rescval2  17983
  Copyright terms: Public domain W3C validator