| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rescco | Structured version Visualization version GIF version | ||
| Description: Composition in the category restriction. (Contributed by Mario Carneiro, 4-Jan-2017.) (Proof shortened by AV, 13-Oct-2024.) |
| Ref | Expression |
|---|---|
| rescbas.d | ⊢ 𝐷 = (𝐶 ↾cat 𝐻) |
| rescbas.b | ⊢ 𝐵 = (Base‘𝐶) |
| rescbas.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
| rescbas.h | ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆)) |
| rescbas.s | ⊢ (𝜑 → 𝑆 ⊆ 𝐵) |
| rescco.o | ⊢ · = (comp‘𝐶) |
| Ref | Expression |
|---|---|
| rescco | ⊢ (𝜑 → · = (comp‘𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ccoid 17597 | . . 3 ⊢ comp = Slot (comp‘ndx) | |
| 2 | slotsbhcdif 17598 | . . . 4 ⊢ ((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 3 | simp3 1156 | . . . . 5 ⊢ (((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) → (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 4 | 3 | necomd 3013 | . . . 4 ⊢ (((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) → (comp‘ndx) ≠ (Hom ‘ndx)) |
| 5 | 2, 4 | ax-mp 5 | . . 3 ⊢ (comp‘ndx) ≠ (Hom ‘ndx) |
| 6 | 1, 5 | setsnid 17398 | . 2 ⊢ (comp‘(𝐶 ↾s 𝑆)) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 7 | rescbas.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵) | |
| 8 | rescbas.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 9 | 8 | fvexi 6907 | . . . . 5 ⊢ 𝐵 ∈ V |
| 10 | 9 | ssex 5285 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 ∈ V) |
| 11 | 7, 10 | syl 18 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
| 12 | eqid 2763 | . . . 4 ⊢ (𝐶 ↾s 𝑆) = (𝐶 ↾s 𝑆) | |
| 13 | rescco.o | . . . 4 ⊢ · = (comp‘𝐶) | |
| 14 | 12, 13 | ressco 17602 | . . 3 ⊢ (𝑆 ∈ V → · = (comp‘(𝐶 ↾s 𝑆))) |
| 15 | 11, 14 | syl 18 | . 2 ⊢ (𝜑 → · = (comp‘(𝐶 ↾s 𝑆))) |
| 16 | rescbas.d | . . . 4 ⊢ 𝐷 = (𝐶 ↾cat 𝐻) | |
| 17 | rescbas.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 18 | rescbas.h | . . . 4 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆)) | |
| 19 | 16, 17, 11, 18 | rescval2 18015 | . . 3 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 20 | 19 | fveq2d 6897 | . 2 ⊢ (𝜑 → (comp‘𝐷) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉))) |
| 21 | 6, 15, 20 | 3eqtr4a 2824 | 1 ⊢ (𝜑 → · = (comp‘𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 Vcvv 3453 ⊆ wss 3899 〈cop 4837 × cxp 5652 Fn wfn 6541 ‘cfv 6546 (class class class)co 7427 sSet csts 17353 ndxcnx 17383 Basecbs 17399 ↾s cress 17420 Hom chom 17451 compcco 17452 ↾cat cresc 17995 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-2 12415 df-3 12416 df-4 12417 df-5 12418 df-6 12419 df-7 12420 df-8 12421 df-9 12422 df-n0 12617 df-z 12704 df-dec 12825 df-sets 17354 df-slot 17372 df-ndx 17384 df-base 17400 df-ress 17421 df-hom 17464 df-cco 17465 df-resc 17998 |
| This theorem is used by: subccatid 18033 issubc3 18036 fullresc 18038 funcres 18083 funcres2b 18084 rngccofval 20890 ringccofval 20919 ssccatid 50325 resccatlem 50326 |
| Copyright terms: Public domain | W3C validator |