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 17043 | . . 3 ⊢ comp = Slot (comp‘ndx) | |
2 | slotsbhcdif 17044 | . . . 4 ⊢ ((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) | |
3 | simp3 1136 | . . . . 5 ⊢ (((Base‘ndx) ≠ (Hom ‘ndx) ∧ (Base‘ndx) ≠ (comp‘ndx) ∧ (Hom ‘ndx) ≠ (comp‘ndx)) → (Hom ‘ndx) ≠ (comp‘ndx)) | |
4 | 3 | necomd 2998 | . . . 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 16838 | . 2 ⊢ (comp‘(𝐶 ↾s 𝑆)) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
7 | rescbas.s | . . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵) | |
8 | rescbas.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
9 | 8 | fvexi 6770 | . . . . 5 ⊢ 𝐵 ∈ V |
10 | 9 | ssex 5240 | . . . 4 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 ∈ V) |
11 | 7, 10 | syl 17 | . . 3 ⊢ (𝜑 → 𝑆 ∈ V) |
12 | eqid 2738 | . . . 4 ⊢ (𝐶 ↾s 𝑆) = (𝐶 ↾s 𝑆) | |
13 | rescco.o | . . . 4 ⊢ · = (comp‘𝐶) | |
14 | 12, 13 | ressco 17047 | . . 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 17457 | . . 3 ⊢ (𝜑 → 𝐷 = ((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉)) |
20 | 19 | fveq2d 6760 | . 2 ⊢ (𝜑 → (comp‘𝐷) = (comp‘((𝐶 ↾s 𝑆) sSet 〈(Hom ‘ndx), 𝐻〉))) |
21 | 6, 15, 20 | 3eqtr4a 2805 | 1 ⊢ (𝜑 → · = (comp‘𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 Vcvv 3422 ⊆ wss 3883 〈cop 4564 × cxp 5578 Fn wfn 6413 ‘cfv 6418 (class class class)co 7255 sSet csts 16792 ndxcnx 16822 Basecbs 16840 ↾s cress 16867 Hom chom 16899 compcco 16900 ↾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 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 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-nel 3049 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-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 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-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 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-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-hom 16912 df-cco 16913 df-resc 17440 |
This theorem is referenced by: subccatid 17477 issubc3 17480 fullresc 17482 funcres 17527 funcres2b 17528 rngccofval 45416 ringccofval 45462 |
Copyright terms: Public domain | W3C validator |