| 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 | eqid 2765 | . . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶) | |
| 2 | eqid 2765 | . . . . 5 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 3 | homfeq.h | . . . . 5 ⊢ 𝐻 = (Hom ‘𝐶) | |
| 4 | 1, 2, 3 | homffval 17768 | . . . 4 ⊢ (Homf ‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦)) |
| 5 | homfeq.1 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) | |
| 6 | eqidd 2766 | . . . . 5 ⊢ (𝜑 → (𝑥𝐻𝑦) = (𝑥𝐻𝑦)) | |
| 7 | 5, 5, 6 | mpoeq123dv 7494 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦))) |
| 8 | 4, 7 | eqtr4id 2819 | . . 3 ⊢ (𝜑 → (Homf ‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦))) |
| 9 | eqid 2765 | . . . . 5 ⊢ (Homf ‘𝐷) = (Homf ‘𝐷) | |
| 10 | eqid 2765 | . . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 11 | homfeq.j | . . . . 5 ⊢ 𝐽 = (Hom ‘𝐷) | |
| 12 | 9, 10, 11 | homffval 17768 | . . . 4 ⊢ (Homf ‘𝐷) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦)) |
| 13 | homfeq.2 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐷)) | |
| 14 | eqidd 2766 | . . . . 5 ⊢ (𝜑 → (𝑥𝐽𝑦) = (𝑥𝐽𝑦)) | |
| 15 | 13, 13, 14 | mpoeq123dv 7494 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦))) |
| 16 | 12, 15 | eqtr4id 2819 | . . 3 ⊢ (𝜑 → (Homf ‘𝐷) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦))) |
| 17 | 8, 16 | eqeq12d 2781 | . 2 ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)))) |
| 18 | ovex 7452 | . . . 4 ⊢ (𝑥𝐻𝑦) ∈ V | |
| 19 | 18 | rgen2w 3086 | . . 3 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) ∈ V |
| 20 | mpo2eqb 7551 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) ∈ V → ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦))) | |
| 21 | 19, 20 | ax-mp 5 | . 2 ⊢ ((𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦)) |
| 22 | 17, 21 | bitrdi 290 | 1 ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) = (𝑥𝐽𝑦))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 ∀wral 3081 Vcvv 3457 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 Basecbs 17291 Hom chom 17343 Homf chomf 17744 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-homf 17748 |
| This theorem is used by: homfeqd 17773 fullresc 17930 resssetc 18171 resscatc 18188 funchomf 49932 initopropd 50078 termopropd 50079 termolmd 50505 |
| Copyright terms: Public domain | W3C validator |