Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rescval2 | Structured version Visualization version GIF version |
Description: Value of the category restriction. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
rescval.1 | ⊢ 𝐷 = (𝐶 ↾cat 𝐻) |
rescval2.1 | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
rescval2.2 | ⊢ (𝜑 → 𝑆 ∈ 𝑊) |
rescval2.3 | ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆)) |
Ref | Expression |
---|---|
rescval2 | ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rescval2.1 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
2 | rescval2.3 | . . . 4 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆)) | |
3 | rescval2.2 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
4 | 3, 3 | xpexd 7468 | . . . 4 ⊢ (𝜑 → (𝑆 × 𝑆) ∈ V) |
5 | fnex 6974 | . . . 4 ⊢ ((𝐻 Fn (𝑆 × 𝑆) ∧ (𝑆 × 𝑆) ∈ V) → 𝐻 ∈ V) | |
6 | 2, 4, 5 | syl2anc 586 | . . 3 ⊢ (𝜑 → 𝐻 ∈ V) |
7 | rescval.1 | . . . 4 ⊢ 𝐷 = (𝐶 ↾cat 𝐻) | |
8 | 7 | rescval 17091 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ V) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
9 | 1, 6, 8 | syl2anc 586 | . 2 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
10 | fndm 6450 | . . . . . . 7 ⊢ (𝐻 Fn (𝑆 × 𝑆) → dom 𝐻 = (𝑆 × 𝑆)) | |
11 | 2, 10 | syl 17 | . . . . . 6 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆)) |
12 | 11 | dmeqd 5769 | . . . . 5 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆)) |
13 | dmxpid 5795 | . . . . 5 ⊢ dom (𝑆 × 𝑆) = 𝑆 | |
14 | 12, 13 | syl6eq 2872 | . . . 4 ⊢ (𝜑 → dom dom 𝐻 = 𝑆) |
15 | 14 | oveq2d 7166 | . . 3 ⊢ (𝜑 → (𝐶 ↾s dom dom 𝐻) = (𝐶 ↾s 𝑆)) |
16 | 15 | oveq1d 7165 | . 2 ⊢ (𝜑 → ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉) = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
17 | 9, 16 | eqtrd 2856 | 1 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 Vcvv 3495 〈cop 4567 × cxp 5548 dom cdm 5550 Fn wfn 6345 ‘cfv 6350 (class class class)co 7150 ndxcnx 16474 sSet csts 16475 ↾s cress 16478 Hom chom 16570 ↾cat cresc 17072 |
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-rep 5183 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-reu 3145 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-pw 4541 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-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-ov 7153 df-oprab 7154 df-mpo 7155 df-resc 17075 |
This theorem is referenced by: rescbas 17093 reschom 17094 rescco 17096 rescabs 17097 rescabs2 17098 dfrngc2 44236 dfringc2 44282 rngcresringcat 44294 rngcrescrhm 44349 rngcrescrhmALTV 44367 |
Copyright terms: Public domain | W3C validator |