| 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 3479 | . . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 3 | elex 3479 | . . 3 ⊢ (𝐻 ∈ 𝑊 → 𝐻 ∈ V) | |
| 4 | simpl 488 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 𝑐 = 𝐶) | |
| 5 | simpr 490 | . . . . . . . 8 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ℎ = 𝐻) | |
| 6 | 5 | dmeqd 5900 | . . . . . . 7 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom ℎ = dom 𝐻) |
| 7 | 6 | dmeqd 5900 | . . . . . 6 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → dom dom ℎ = dom dom 𝐻) |
| 8 | 4, 7 | oveq12d 7441 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → (𝑐 ↾s dom dom ℎ) = (𝐶 ↾s dom dom 𝐻)) |
| 9 | 5 | opeq2d 4850 | . . . . 5 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → 〈(Hom ‘ndx), ℎ〉 = 〈(Hom ‘ndx), 𝐻〉) |
| 10 | 8, 9 | oveq12d 7441 | . . . 4 ⊢ ((𝑐 = 𝐶 ∧ ℎ = 𝐻) → ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉) = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 11 | df-resc 17893 | . . . 4 ⊢ ↾cat = (𝑐 ∈ V, ℎ ∈ V ↦ ((𝑐 ↾s dom dom ℎ) sSet 〈(Hom ‘ndx), ℎ〉)) | |
| 12 | ovex 7456 | . . . 4 ⊢ ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉) ∈ V | |
| 13 | 10, 11, 12 | ovmpoa 7578 | . . 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 2813 | 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 2146 Vcvv 3458 〈cop 4600 dom cdm 5666 ‘cfv 6543 (class class class)co 7423 sSet csts 17248 ndxcnx 17278 ↾s cress 17315 Hom chom 17346 ↾cat cresc 17890 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-sbc 3748 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6499 df-fun 6545 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-resc 17893 |
| This theorem is used by: rescval2 17910 |
| Copyright terms: Public domain | W3C validator |