| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rescval | Structured version Visualization version GIF version | ||
| Description: Value of the category restriction. (Contributed by Mario Carneiro, 4-Jan-2017.) |
| Ref | Expression |
|---|---|
| rescval.1 | ⊢ 𝐷 = (𝐶 ↾cat 𝐻) |
| Ref | Expression |
|---|---|
| rescval | ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rescval.1 | . 2 ⊢ 𝐷 = (𝐶 ↾cat 𝐻) | |
| 2 | elex 3471 | . . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 3 | elex 3471 | . . 3 ⊢ (𝐻 ∈ 𝑊 → 𝐻 ∈ V) | |
| 4 | simpl 488 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 𝑐 = 𝐶) | |
| 5 | simpr 490 | . . . . . . . 8 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ℎ = 𝐻) | |
| 6 | 5 | dmeqd 5886 | . . . . . . 7 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom ℎ = dom 𝐻) |
| 7 | 6 | dmeqd 5886 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom dom ℎ = dom dom 𝐻) |
| 8 | 4, 7 | oveq12d 7439 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → (𝑐 ↾s dom dom ℎ) = (𝐶 ↾s dom dom 𝐻)) |
| 9 | 5 | opeq2d 4846 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 〈(Hom ‘ndx), ℎ〉 = 〈(Hom ‘ndx), 𝐻〉) |
| 10 | 8, 9 | oveq12d 7439 | . . . 4 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉) = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 11 | df-resc 17992 | . . . 4 ⊢ ↾cat = (𝑐 ∈ V, ℎ ∈ V ↦ ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉)) | |
| 12 | ovex 7454 | . . . 4 ⊢ ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉) ∈ V | |
| 13 | 10, 11, 12 | ovmpoa 7576 | . . 3 ⊢ ((𝐶 ∈ V ∧ 𝐻 ∈ V) → (𝐶 ↾cat 𝐻) = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 14 | 2, 3, 13 | syl2an 608 | . 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → (𝐶 ↾cat 𝐻) = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 15 | 1, 14 | eqtrid 2807 | 1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ 𝑊) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 〈cop 4834 dom cdm 5650 ‘cfv 6539 (class class class)co 7421 sSet csts 17347 ndxcnx 17377 ↾s cress 17414 Hom chom 17445 ↾cat cresc 17989 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-iota 6494 df-fun 6541 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-resc 17992 |
| This theorem is used by: rescval2 18009 |
| Copyright terms: Public domain | W3C validator |