| 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 17371 | . . 3 ⊢ comp = Slot (comp‘ndx) | |
| 2 | slotsbhcdif 17372 | . . . 4 ⊢ ((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 3 | simp3 1139 | . . . . 5 ⊢ (((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) → (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 4 | 3 | necomd 2988 | . . . 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 17172 | . 2 ⊢ (comp‘(𝐶 ↾s 𝑆)) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 7 | rescbas.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵) | |
| 8 | rescbas.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 9 | 8 | fvexi 6849 | . . . . 5 ⊢ 𝐵 ∈ V |
| 10 | 9 | ssex 5259 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 ∈ V) |
| 11 | 7, 10 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
| 12 | eqid 2737 | . . . 4 ⊢ (𝐶 ↾s 𝑆) = (𝐶 ↾s 𝑆) | |
| 13 | rescco.o | . . . 4 ⊢ · = (comp‘𝐶) | |
| 14 | 12, 13 | ressco 17376 | . . 3 ⊢ (𝑆 ∈ V → · = (comp‘(𝐶 ↾s 𝑆))) |
| 15 | 11, 14 | syl 17 | . 2 ⊢ (𝜑 → · = (comp‘(𝐶 ↾s 𝑆))) |
| 16 | rescbas.d | . . . 4 ⊢ 𝐷 = (𝐶 ↾cat 𝐻) | |
| 17 | rescbas.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
| 18 | rescbas.h | . . . 4 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆)) | |
| 19 | 16, 17, 11, 18 | rescval2 17789 | . . 3 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 20 | 19 | fveq2d 6839 | . 2 ⊢ (𝜑 → (comp‘𝐷) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉))) |
| 21 | 6, 15, 20 | 3eqtr4a 2798 | 1 ⊢ (𝜑 → · = (comp‘𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Vcvv 3430 ⊆ wss 3890 〈cop 4574 × cxp 5623 Fn wfn 6488 ‘cfv 6493 (class class class)co 7361 sSet csts 17127 ndxcnx 17157 Basecbs 17173 ↾s cress 17194 Hom chom 17225 compcco 17226 ↾cat cresc 17769 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-hom 17238 df-cco 17239 df-resc 17772 |
| This theorem is referenced by: subccatid 17807 issubc3 17810 fullresc 17812 funcres 17857 funcres2b 17858 rngccofval 20597 ringccofval 20626 ssccatid 49562 resccatlem 49563 |
| Copyright terms: Public domain | W3C validator |