Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > comfeqd | Structured version Visualization version GIF version |
Description: Condition for two categories with the same hom-sets to have the same composition. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
comfeqd.1 | ⊢ (𝜑 → (comp‘𝐶) = (comp‘𝐷)) |
comfeqd.2 | ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷)) |
Ref | Expression |
---|---|
comfeqd | ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | comfeqd.1 | . . . . . . . . 9 ⊢ (𝜑 → (comp‘𝐶) = (comp‘𝐷)) | |
2 | 1 | oveqd 7173 | . . . . . . . 8 ⊢ (𝜑 → (〈𝑥, 𝑦〉(comp‘𝐶)𝑧) = (〈𝑥, 𝑦〉(comp‘𝐷)𝑧)) |
3 | 2 | oveqd 7173 | . . . . . . 7 ⊢ (𝜑 → (𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
4 | 3 | ralrimivw 3183 | . . . . . 6 ⊢ (𝜑 → ∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
5 | 4 | ralrimivw 3183 | . . . . 5 ⊢ (𝜑 → ∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
6 | 5 | ralrimivw 3183 | . . . 4 ⊢ (𝜑 → ∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
7 | 6 | ralrimivw 3183 | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
8 | 7 | ralrimivw 3183 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓)) |
9 | eqid 2821 | . . 3 ⊢ (comp‘𝐶) = (comp‘𝐶) | |
10 | eqid 2821 | . . 3 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
11 | eqid 2821 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
12 | eqidd 2822 | . . 3 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐶)) | |
13 | comfeqd.2 | . . . 4 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷)) | |
14 | 13 | homfeqbas 16966 | . . 3 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷)) |
15 | 9, 10, 11, 12, 14, 13 | comfeq 16976 | . 2 ⊢ (𝜑 → ((compf‘𝐶) = (compf‘𝐷) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀𝑧 ∈ (Base‘𝐶)∀𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)∀𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧)(𝑔(〈𝑥, 𝑦〉(comp‘𝐶)𝑧)𝑓) = (𝑔(〈𝑥, 𝑦〉(comp‘𝐷)𝑧)𝑓))) |
16 | 8, 15 | mpbird 259 | 1 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∀wral 3138 〈cop 4573 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 Hom chom 16576 compcco 16577 Homf chomf 16937 compfccomf 16938 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-1st 7689 df-2nd 7690 df-homf 16941 df-comf 16942 |
This theorem is referenced by: fullresc 17121 |
Copyright terms: Public domain | W3C validator |