Theorem funchomf 50416

Description: Source categories of a functor have the same set of objects and morphisms. (Contributed by Zhi Wang, 10-Nov-2025.)

Hypotheses

Ref	Expression
funchomf.1	⊢ (𝜑 → 𝐹(𝐴 Func 𝐶)𝐺)
funchomf.2	⊢ (𝜑 → 𝐹(𝐵 Func 𝐷)𝐺)

Assertion

Ref	Expression
funchomf	⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))

Proof of Theorem funchomf

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2763	. . . . . 6 ⊢ (Base‘𝐴) = (Base‘𝐴)
2		eqid 2763	. . . . . 6 ⊢ (Hom ‘𝐴) = (Hom ‘𝐴)
3		eqid 2763	. . . . . 6 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
4		funchomf.1	. . . . . . 7 ⊢ (𝜑 → 𝐹(𝐴 Func 𝐶)𝐺)
5	4	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝐹(𝐴 Func 𝐶)𝐺)
6		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑥 ∈ (Base‘𝐴))
7		simprr 785	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑦 ∈ (Base‘𝐴))
8	1, 2, 3, 5, 6, 7	funcf2 18069	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥𝐺𝑦):(𝑥(Hom ‘𝐴)𝑦)⟶((𝐹‘𝑥)(Hom ‘𝐶)(𝐹‘𝑦)))
9	8	ffnd 6729	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥𝐺𝑦) Fn (𝑥(Hom ‘𝐴)𝑦))
10		eqid 2763	. . . . . 6 ⊢ (Base‘𝐵) = (Base‘𝐵)
11		eqid 2763	. . . . . 6 ⊢ (Hom ‘𝐵) = (Hom ‘𝐵)
12		eqid 2763	. . . . . 6 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
13		funchomf.2	. . . . . . 7 ⊢ (𝜑 → 𝐹(𝐵 Func 𝐷)𝐺)
14	13	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝐹(𝐵 Func 𝐷)𝐺)
15		eqid 2763	. . . . . . . . . . 11 ⊢ (Base‘𝐶) = (Base‘𝐶)
16	1, 15, 4	funcf1 18067	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:(Base‘𝐴)⟶(Base‘𝐶))
17	16	ffnd 6729	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 Fn (Base‘𝐴))
18		eqid 2763	. . . . . . . . . . 11 ⊢ (Base‘𝐷) = (Base‘𝐷)
19	10, 18, 13	funcf1 18067	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:(Base‘𝐵)⟶(Base‘𝐷))
20	19	ffnd 6729	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 Fn (Base‘𝐵))
21		fndmu 6665	. . . . . . . . 9 ⊢ ((𝐹 Fn (Base‘𝐴) ∧ 𝐹 Fn (Base‘𝐵)) → (Base‘𝐴) = (Base‘𝐵))
22	17, 20, 21	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (Base‘𝐴) = (Base‘𝐵))
23	22	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (Base‘𝐴) = (Base‘𝐵))
24	6, 23	eleqtrd 2866	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑥 ∈ (Base‘𝐵))
25	7, 23	eleqtrd 2866	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑦 ∈ (Base‘𝐵))
26	10, 11, 12, 14, 24, 25	funcf2 18069	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥𝐺𝑦):(𝑥(Hom ‘𝐵)𝑦)⟶((𝐹‘𝑥)(Hom ‘𝐷)(𝐹‘𝑦)))
27	26	ffnd 6729	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥𝐺𝑦) Fn (𝑥(Hom ‘𝐵)𝑦))
28		fndmu 6665	. . . 4 ⊢ (((𝑥𝐺𝑦) Fn (𝑥(Hom ‘𝐴)𝑦) ∧ (𝑥𝐺𝑦) Fn (𝑥(Hom ‘𝐵)𝑦)) → (𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
29	9, 27, 28	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
30	29	ralrimivva 3209	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)(𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
31		eqidd 2764	. . 3 ⊢ (𝜑 → (Base‘𝐴) = (Base‘𝐴))
32	2, 11, 31, 22	homfeq 17894	. 2 ⊢ (𝜑 → ((Homf ‘𝐴) = (Homf ‘𝐵) ↔ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)(𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦)))
33	30, 32	mpbird 260	1 ⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5106   Fn wfn 6550  ‘cfv 6555  (class class class)co 7440  Basecbs 17413  Hom chom 17465  Hom_f chomf 17866   Func cfunc 18055

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  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-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-map 8874  df-ixp 8951  df-homf 17870  df-func 18059

This theorem is used by:  idfu1stalem  50419  idfu2nda  50422  fthcomf  50476