Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > homfeq | Structured version Visualization version GIF version |
Description: Condition for two categories with the same base to have the same hom-sets. (Contributed by Mario Carneiro, 6-Jan-2017.) |
Ref | Expression |
---|---|
homfeq.h | ⊢ 𝐻 = (Hom ‘𝐶) |
homfeq.j | ⊢ 𝐽 = (Hom ‘𝐷) |
homfeq.1 | ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) |
homfeq.2 | ⊢ (𝜑 → 𝐵 = (Base‘𝐷)) |
Ref | Expression |
---|---|
homfeq | ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | homfeq.1 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) | |
2 | eqidd 2822 | . . . . 5 ⊢ (𝜑 → (𝑥𝐻𝑦) = (𝑥𝐻𝑦)) | |
3 | 1, 1, 2 | mpoeq123dv 7223 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦))) |
4 | eqid 2821 | . . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶) | |
5 | eqid 2821 | . . . . 5 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
6 | homfeq.h | . . . . 5 ⊢ 𝐻 = (Hom ‘𝐶) | |
7 | 4, 5, 6 | homffval 16954 | . . . 4 ⊢ (Homf ‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦)) |
8 | 3, 7 | syl6reqr 2875 | . . 3 ⊢ (𝜑 → (Homf ‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦))) |
9 | homfeq.2 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐷)) | |
10 | eqidd 2822 | . . . . 5 ⊢ (𝜑 → (𝑥𝐽𝑦) = (𝑥𝐽𝑦)) | |
11 | 9, 9, 10 | mpoeq123dv 7223 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦))) |
12 | eqid 2821 | . . . . 5 ⊢ (Homf ‘𝐷) = (Homf ‘𝐷) | |
13 | eqid 2821 | . . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
14 | homfeq.j | . . . . 5 ⊢ 𝐽 = (Hom ‘𝐷) | |
15 | 12, 13, 14 | homffval 16954 | . . . 4 ⊢ (Homf ‘𝐷) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦)) |
16 | 11, 15 | syl6reqr 2875 | . . 3 ⊢ (𝜑 → (Homf ‘𝐷) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦))) |
17 | 8, 16 | eqeq12d 2837 | . 2 ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)))) |
18 | ovex 7183 | . . . 4 ⊢ (𝑥𝐻𝑦) ∈ V | |
19 | 18 | rgen2w 3151 | . . 3 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) ∈ V |
20 | mpo2eqb 7277 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) ∈ V → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦))) | |
21 | 19, 20 | ax-mp 5 | . 2 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦)) |
22 | 17, 21 | syl6bb 289 | 1 ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1533 ∈ wcel 2110 ∀wral 3138 Vcvv 3494 ‘cfv 6349 (class class class)co 7150 ∈ cmpo 7152 Basecbs 16477 Hom chom 16570 Homf chomf 16931 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-homf 16935 |
This theorem is referenced by: homfeqd 16959 fullresc 17115 resssetc 17346 resscatc 17359 |
Copyright terms: Public domain | W3C validator |