| 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 2763 | . . . . 5 ⊢ (Homf ‘𝐶) = (Homf ‘𝐶) | |
| 2 | eqid 2763 | . . . . 5 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
| 3 | homfeq.h | . . . . 5 ⊢ 𝐻 = (Hom ‘𝐶) | |
| 4 | 1, 2, 3 | homffval 17914 | . . . 4 ⊢ (Homf ‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦)) |
| 5 | homfeq.1 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐶)) | |
| 6 | eqidd 2764 | . . . . 5 ⊢ (𝜑 → (𝑥𝐻𝑦) = (𝑥𝐻𝑦)) | |
| 7 | 5, 5, 6 | mpoeq123dv 7526 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥𝐻𝑦))) |
| 8 | 4, 7 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → (Homf ‘𝐶) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦))) |
| 9 | eqid 2763 | . . . . 5 ⊢ (Homf ‘𝐷) = (Homf ‘𝐷) | |
| 10 | eqid 2763 | . . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 11 | homfeq.j | . . . . 5 ⊢ 𝐽 = (Hom ‘𝐷) | |
| 12 | 9, 10, 11 | homffval 17914 | . . . 4 ⊢ (Homf ‘𝐷) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦)) |
| 13 | homfeq.2 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐷)) | |
| 14 | eqidd 2764 | . . . . 5 ⊢ (𝜑 → (𝑥𝐽𝑦) = (𝑥𝐽𝑦)) | |
| 15 | 13, 13, 14 | mpoeq123dv 7526 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)) = (𝑥 ∈ (Base‘𝐷), 𝑦 ∈ (Base‘𝐷) ↦ (𝑥𝐽𝑦))) |
| 16 | 12, 15 | eqtr4id 2817 | . . 3 ⊢ (𝜑 → (Homf ‘𝐷) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦))) |
| 17 | 8, 16 | eqeq12d 2779 | . 2 ⊢ (𝜑 → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐻𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥𝐽𝑦)))) |
| 18 | ovex 7484 | . . . 4 ⊢ (𝑥𝐻𝑦) ∈ V | |
| 19 | 18 | rgen2w 3085 | . . 3 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥𝐻𝑦) ∈ V |
| 20 | mpo2eqb 7583 | . . 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 2147 ∀wral 3080 Vcvv 3454 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 Basecbs 17431 Hom chom 17483 Homf chomf 17890 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-homf 17894 |
| This theorem is used by: homfeqd 17919 fullresc 18076 resssetc 18317 resscatc 18334 funchomf 50544 initopropd 50696 termopropd 50697 termolmd 51184 |
| Copyright terms: Public domain | W3C validator |