| Mathbox for Zhi Wang |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 2ndfpropd | Structured version Visualization version GIF version | ||
| Description: If two categories have the same set of objects, morphisms, and compositions, then they have same second projection functors. (Contributed by Zhi Wang, 20-Nov-2025.) |
| Ref | Expression |
|---|---|
| 1stfpropd.1 | ⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵)) |
| 1stfpropd.2 | ⊢ (𝜑 → (compf‘𝐴) = (compf‘𝐵)) |
| 1stfpropd.3 | ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷)) |
| 1stfpropd.4 | ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷)) |
| 1stfpropd.a | ⊢ (𝜑 → 𝐴 ∈ Cat) |
| 1stfpropd.b | ⊢ (𝜑 → 𝐵 ∈ Cat) |
| 1stfpropd.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
| 1stfpropd.d | ⊢ (𝜑 → 𝐷 ∈ Cat) |
| Ref | Expression |
|---|---|
| 2ndfpropd | ⊢ (𝜑 → (𝐴 2ndF 𝐶) = (𝐵 2ndF 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1stfpropd.1 | . . . . . 6 ⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵)) | |
| 2 | 1stfpropd.2 | . . . . . 6 ⊢ (𝜑 → (compf‘𝐴) = (compf‘𝐵)) | |
| 3 | 1stfpropd.3 | . . . . . 6 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷)) | |
| 4 | 1stfpropd.4 | . . . . . 6 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷)) | |
| 5 | 1stfpropd.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Cat) | |
| 6 | 1stfpropd.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ Cat) | |
| 7 | 1stfpropd.c | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
| 8 | 1stfpropd.d | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ Cat) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | xpcpropd 18318 | . . . . 5 ⊢ (𝜑 → (𝐴 ×c 𝐶) = (𝐵 ×c 𝐷)) |
| 10 | 9 | fveq2d 6884 | . . . 4 ⊢ (𝜑 → (Base‘(𝐴 ×c 𝐶)) = (Base‘(𝐵 ×c 𝐷))) |
| 11 | 10 | reseq2d 5973 | . . 3 ⊢ (𝜑 → (2nd ↾ (Base‘(𝐴 ×c 𝐶))) = (2nd ↾ (Base‘(𝐵 ×c 𝐷)))) |
| 12 | 9 | fveq2d 6884 | . . . . . 6 ⊢ (𝜑 → (Hom ‘(𝐴 ×c 𝐶)) = (Hom ‘(𝐵 ×c 𝐷))) |
| 13 | 12 | oveqd 7432 | . . . . 5 ⊢ (𝜑 → (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦) = (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)) |
| 14 | 13 | reseq2d 5973 | . . . 4 ⊢ (𝜑 → (2nd ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)) = (2nd ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦))) |
| 15 | 10, 10, 14 | mpoeq123dv 7490 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦))) = (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))) |
| 16 | 11, 15 | opeq12d 4841 | . 2 ⊢ (𝜑 → 〈(2nd ↾ (Base‘(𝐴 ×c 𝐶))), (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)))〉 = 〈(2nd ↾ (Base‘(𝐵 ×c 𝐷))), (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))〉) |
| 17 | eqid 2760 | . . 3 ⊢ (𝐴 ×c 𝐶) = (𝐴 ×c 𝐶) | |
| 18 | eqid 2760 | . . 3 ⊢ (Base‘(𝐴 ×c 𝐶)) = (Base‘(𝐴 ×c 𝐶)) | |
| 19 | eqid 2760 | . . 3 ⊢ (Hom ‘(𝐴 ×c 𝐶)) = (Hom ‘(𝐴 ×c 𝐶)) | |
| 20 | eqid 2760 | . . 3 ⊢ (𝐴 2ndF 𝐶) = (𝐴 2ndF 𝐶) | |
| 21 | 17, 18, 19, 5, 7, 20 | 2ndfval 18304 | . 2 ⊢ (𝜑 → (𝐴 2ndF 𝐶) = 〈(2nd ↾ (Base‘(𝐴 ×c 𝐶))), (𝑥 ∈ (Base‘(𝐴 ×c 𝐶)), 𝑦 ∈ (Base‘(𝐴 ×c 𝐶)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐴 ×c 𝐶))𝑦)))〉) |
| 22 | eqid 2760 | . . 3 ⊢ (𝐵 ×c 𝐷) = (𝐵 ×c 𝐷) | |
| 23 | eqid 2760 | . . 3 ⊢ (Base‘(𝐵 ×c 𝐷)) = (Base‘(𝐵 ×c 𝐷)) | |
| 24 | eqid 2760 | . . 3 ⊢ (Hom ‘(𝐵 ×c 𝐷)) = (Hom ‘(𝐵 ×c 𝐷)) | |
| 25 | eqid 2760 | . . 3 ⊢ (𝐵 2ndF 𝐷) = (𝐵 2ndF 𝐷) | |
| 26 | 22, 23, 24, 6, 8, 25 | 2ndfval 18304 | . 2 ⊢ (𝜑 → (𝐵 2ndF 𝐷) = 〈(2nd ↾ (Base‘(𝐵 ×c 𝐷))), (𝑥 ∈ (Base‘(𝐵 ×c 𝐷)), 𝑦 ∈ (Base‘(𝐵 ×c 𝐷)) ↦ (2nd ↾ (𝑥(Hom ‘(𝐵 ×c 𝐷))𝑦)))〉) |
| 27 | 16, 21, 26 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → (𝐴 2ndF 𝐶) = (𝐵 2ndF 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 〈cop 4590 ↾ cres 5657 ‘cfv 6534 (class class class)co 7415 ∈ cmpo 7417 2nd c2nd 7987 Basecbs 17323 Hom chom 17375 Catccat 17774 Homf chomf 17776 compfccomf 17777 ×c cxpc 18278 2ndF c2ndf 18280 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7738 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7372 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8282 df-wrecs 8313 df-recs 8362 df-rdg 8401 df-1o 8459 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-pnf 11291 df-mnf 11292 df-xr 11293 df-ltxr 11294 df-le 11295 df-sub 11489 df-neg 11490 df-nn 12280 df-2 12349 df-3 12350 df-4 12351 df-5 12352 df-6 12353 df-7 12354 df-8 12355 df-9 12356 df-n0 12551 df-z 12638 df-dec 12759 df-uz 12910 df-fz 13584 df-struct 17261 df-slot 17296 df-ndx 17308 df-base 17324 df-hom 17388 df-cco 17389 df-homf 17780 df-comf 17781 df-xpc 18282 df-2ndf 18284 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |