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 7579 | . . . 4 ⊢ (𝜑 → (𝑆 × 𝑆) ∈ V) |
5 | fnex 7075 | . . . 4 ⊢ ((𝐻 Fn (𝑆 × 𝑆) ∧ (𝑆 × 𝑆) ∈ V) → 𝐻 ∈ V) | |
6 | 2, 4, 5 | syl2anc 583 | . . 3 ⊢ (𝜑 → 𝐻 ∈ V) |
7 | rescval.1 | . . . 4 ⊢ 𝐷 = (𝐶 ↾cat 𝐻) | |
8 | 7 | rescval 17456 | . . 3 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐻 ∈ V) → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
9 | 1, 6, 8 | syl2anc 583 | . 2 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉)) |
10 | 2 | fndmd 6522 | . . . . . 6 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆)) |
11 | 10 | dmeqd 5803 | . . . . 5 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆)) |
12 | dmxpid 5828 | . . . . 5 ⊢ dom (𝑆 × 𝑆) = 𝑆 | |
13 | 11, 12 | eqtrdi 2795 | . . . 4 ⊢ (𝜑 → dom dom 𝐻 = 𝑆) |
14 | 13 | oveq2d 7271 | . . 3 ⊢ (𝜑 → (𝐶 ↾s dom dom 𝐻) = (𝐶 ↾s 𝑆)) |
15 | 14 | oveq1d 7270 | . 2 ⊢ (𝜑 → ((𝐶 ↾s dom dom 𝐻) sSet 〈(Hom ‘ndx), 𝐻〉) = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
16 | 9, 15 | eqtrd 2778 | 1 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2108 Vcvv 3422 〈cop 4564 × cxp 5578 dom cdm 5580 Fn wfn 6413 ‘cfv 6418 (class class class)co 7255 sSet csts 16792 ndxcnx 16822 ↾s cress 16867 Hom chom 16899 ↾cat cresc 17437 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-resc 17440 |
This theorem is referenced by: rescbas 17458 rescbasOLD 17459 reschom 17460 rescco 17462 resccoOLD 17463 rescabs 17464 rescabs2 17465 dfrngc2 45418 dfringc2 45464 rngcresringcat 45476 rngcrescrhm 45531 rngcrescrhmALTV 45549 |
Copyright terms: Public domain | W3C validator |