| 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 3474 | . . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 3 | elex 3474 | . . 3 ⊢ (𝐻 ∈ 𝑊 → 𝐻 ∈ V) | |
| 4 | simpl 488 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 𝑐 = 𝐶) | |
| 5 | simpr 490 | . . . . . . . 8 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ℎ = 𝐻) | |
| 6 | 5 | dmeqd 5893 | . . . . . . 7 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom ℎ = dom 𝐻) |
| 7 | 6 | dmeqd 5893 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom dom ℎ = dom dom 𝐻) |
| 8 | 4, 7 | oveq12d 7435 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → (𝑐 ↾s dom dom ℎ) = (𝐶 ↾s dom dom 𝐻)) |
| 9 | 5 | opeq2d 4843 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 〈(Hom ‘ndx), ℎ〉 = 〈(Hom ‘ndx), 𝐻〉) |
| 10 | 8, 9 | oveq12d 7435 | . . . 4 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉) = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 11 | df-resc 17906 | . . . 4 ⊢ ↾cat = (𝑐 ∈ V, ℎ ∈ V ↦ ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉)) | |
| 12 | ovex 7450 | . . . 4 ⊢ ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉) ∈ V | |
| 13 | 10, 11, 12 | ovmpoa 7572 | . . 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 2809 | 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 3453 〈cop 4593 dom cdm 5659 ‘cfv 6537 (class class class)co 7417 sSet csts 17261 ndxcnx 17291 ↾s cress 17328 Hom chom 17359 ↾cat cresc 17903 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7420 df-oprab 7421 df-mpo 7422 df-resc 17906 |
| This theorem is used by: rescval2 17923 |
| Copyright terms: Public domain | W3C validator |