| 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 17318 | . . 3 ⊢ comp = Slot (comp‘ndx) | |
| 2 | slotsbhcdif 17319 | . . . 4 ⊢ ((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 3 | simp3 1138 | . . . . 5 ⊢ (((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) → (Hom ‘ndx) ≠ (comp‘ndx)) | |
| 4 | 3 | necomd 2980 | . . . 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 17119 | . 2 ⊢ (comp‘(𝐶 ↾s 𝑆)) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 7 | rescbas.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵) | |
| 8 | rescbas.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 9 | 8 | fvexi 6836 | . . . . 5 ⊢ 𝐵 ∈ V |
| 10 | 9 | ssex 5260 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 ∈ V) |
| 11 | 7, 10 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
| 12 | eqid 2729 | . . . 4 ⊢ (𝐶 ↾s 𝑆) = (𝐶 ↾s 𝑆) | |
| 13 | rescco.o | . . . 4 ⊢ · = (comp‘𝐶) | |
| 14 | 12, 13 | ressco 17323 | . . 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 17735 | . . 3 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
| 20 | 19 | fveq2d 6826 | . 2 ⊢ (𝜑 → (comp‘𝐷) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉))) |
| 21 | 6, 15, 20 | 3eqtr4a 2790 | 1 ⊢ (𝜑 → · = (comp‘𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 Vcvv 3436 ⊆ wss 3903 〈cop 4583 × cxp 5617 Fn wfn 6477 ‘cfv 6482 (class class class)co 7349 sSet csts 17074 ndxcnx 17104 Basecbs 17120 ↾s cress 17141 Hom chom 17172 compcco 17173 ↾cat cresc 17715 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-3 12192 df-4 12193 df-5 12194 df-6 12195 df-7 12196 df-8 12197 df-9 12198 df-n0 12385 df-z 12472 df-dec 12592 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-hom 17185 df-cco 17186 df-resc 17718 |
| This theorem is referenced by: subccatid 17753 issubc3 17756 fullresc 17758 funcres 17803 funcres2b 17804 rngccofval 20511 ringccofval 20540 ssccatid 49057 resccatlem 49058 |
| Copyright terms: Public domain | W3C validator |