Theorem initopropd 50696

Description: Two structures with the same base, hom-sets and composition operation have the same initial objects. (Contributed by Zhi Wang, 23-Oct-2025.)

Hypotheses

Ref	Expression
initopropd.1	⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
initopropd.2	⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))

Assertion

Ref	Expression
initopropd	⊢ (𝜑 → (InitO‘𝐶) = (InitO‘𝐷))

Proof of Theorem initopropd

Dummy variables 𝑎 𝑏 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		initopropd.1	. . . 4 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
2	1	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → (Homf ‘𝐶) = (Homf ‘𝐷))
3		initopropd.2	. . . 4 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
4	3	adantr 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → (compf‘𝐶) = (compf‘𝐷))
5		simpr 490	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → ¬ 𝐶 ∈ V)
6	2, 4, 5	initopropdlem 50693	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 ∈ V) → (InitO‘𝐶) = (InitO‘𝐷))
7	1	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (Homf ‘𝐶) = (Homf ‘𝐷))
8	7	eqcomd 2769	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (Homf ‘𝐷) = (Homf ‘𝐶))
9	3	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (compf‘𝐶) = (compf‘𝐷))
10	9	eqcomd 2769	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (compf‘𝐷) = (compf‘𝐶))
11		simpr 490	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → ¬ 𝐷 ∈ V)
12	8, 10, 11	initopropdlem 50693	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (InitO‘𝐷) = (InitO‘𝐶))
13	12	eqcomd 2769	. 2 ⊢ ((𝜑 ∧ ¬ 𝐷 ∈ V) → (InitO‘𝐶) = (InitO‘𝐷))
14	1	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (Homf ‘𝐶) = (Homf ‘𝐷))
15	14	adantr 486	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (Homf ‘𝐶) = (Homf ‘𝐷))
16		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
17		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
18		eqidd 2764	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (Base‘𝐶) = (Base‘𝐶))
19	15	homfeqbas 17920	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (Base‘𝐶) = (Base‘𝐷))
20	16, 17, 18, 19	homfeq 17918	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → ((Homf ‘𝐶) = (Homf ‘𝐷) ↔ ∀𝑎 ∈ (Base‘𝐶)∀𝑏 ∈ (Base‘𝐶)(𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏)))
21	15, 20	mpbid 235	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → ∀𝑎 ∈ (Base‘𝐶)∀𝑏 ∈ (Base‘𝐶)(𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏))
22	21	r19.21bi 3258	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ∧ 𝑎 ∈ (Base‘𝐶)) → ∀𝑏 ∈ (Base‘𝐶)(𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏))
23	22	r19.21bi 3258	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (𝑎(Hom ‘𝐶)𝑏) = (𝑎(Hom ‘𝐷)𝑏))
24	23	eleq2d 2850	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (ℎ ∈ (𝑎(Hom ‘𝐶)𝑏) ↔ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)))
25	24	eubidv 2614	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ∧ 𝑎 ∈ (Base‘𝐶)) ∧ 𝑏 ∈ (Base‘𝐶)) → (∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏) ↔ ∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)))
26	25	ralbidva 3187	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ∧ 𝑎 ∈ (Base‘𝐶)) → (∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏) ↔ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)))
27	26	pm5.32da 590	. . . . . 6 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → ((𝑎 ∈ (Base‘𝐶) ∧ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏)) ↔ (𝑎 ∈ (Base‘𝐶) ∧ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏))))
28	19	eleq2d 2850	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (𝑎 ∈ (Base‘𝐶) ↔ 𝑎 ∈ (Base‘𝐷)))
29	19	raleqdv 3323	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏) ↔ ∀𝑏 ∈ (Base‘𝐷)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)))
30	28, 29	anbi12d 644	. . . . . 6 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → ((𝑎 ∈ (Base‘𝐶) ∧ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)) ↔ (𝑎 ∈ (Base‘𝐷) ∧ ∀𝑏 ∈ (Base‘𝐷)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏))))
31	27, 30	bitrd 282	. . . . 5 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → ((𝑎 ∈ (Base‘𝐶) ∧ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏)) ↔ (𝑎 ∈ (Base‘𝐷) ∧ ∀𝑏 ∈ (Base‘𝐷)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏))))
32	31	rabbidva2 3418	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → {𝑎 ∈ (Base‘𝐶) ∣ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏)} = {𝑎 ∈ (Base‘𝐷) ∣ ∀𝑏 ∈ (Base‘𝐷)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)})
33		simpr 490	. . . . 5 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → 𝐶 ∈ Cat)
34		eqid 2763	. . . . 5 ⊢ (Base‘𝐶) = (Base‘𝐶)
35	33, 34, 16	initoval 18218	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (InitO‘𝐶) = {𝑎 ∈ (Base‘𝐶) ∣ ∀𝑏 ∈ (Base‘𝐶)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐶)𝑏)})
36	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (compf‘𝐶) = (compf‘𝐷))
37		simprl 783	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → 𝐶 ∈ V)
38		simprr 785	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → 𝐷 ∈ V)
39	14, 36, 37, 38	catpropd 17933	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (𝐶 ∈ Cat ↔ 𝐷 ∈ Cat))
40	39	biimpa 482	. . . . 5 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → 𝐷 ∈ Cat)
41		eqid 2763	. . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷)
42	40, 41, 17	initoval 18218	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (InitO‘𝐷) = {𝑎 ∈ (Base‘𝐷) ∣ ∀𝑏 ∈ (Base‘𝐷)∃!ℎ ℎ ∈ (𝑎(Hom ‘𝐷)𝑏)})
43	32, 35, 42	3eqtr4d 2808	. . 3 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) → (InitO‘𝐶) = (InitO‘𝐷))
44	39	pm5.32i 585	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐶 ∈ Cat) ↔ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐷 ∈ Cat))
45	44, 43	sylbir 238	. . 3 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ 𝐷 ∈ Cat) → (InitO‘𝐶) = (InitO‘𝐷))
46		initofn 18212	. . . . . . . 8 ⊢ InitO Fn Cat
47	46	fndmi 6673	. . . . . . 7 ⊢ dom InitO = Cat
48	47	eleq2i 2856	. . . . . 6 ⊢ (𝐶 ∈ dom InitO ↔ 𝐶 ∈ Cat)
49		ndmfv 6948	. . . . . 6 ⊢ (¬ 𝐶 ∈ dom InitO → (InitO‘𝐶) = ∅)
50	48, 49	sylnbir 334	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → (InitO‘𝐶) = ∅)
51	50	ad2antrl 741	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ (¬ 𝐶 ∈ Cat ∧ ¬ 𝐷 ∈ Cat)) → (InitO‘𝐶) = ∅)
52	47	eleq2i 2856	. . . . . 6 ⊢ (𝐷 ∈ dom InitO ↔ 𝐷 ∈ Cat)
53		ndmfv 6948	. . . . . 6 ⊢ (¬ 𝐷 ∈ dom InitO → (InitO‘𝐷) = ∅)
54	52, 53	sylnbir 334	. . . . 5 ⊢ (¬ 𝐷 ∈ Cat → (InitO‘𝐷) = ∅)
55	54	ad2antll 742	. . . 4 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ (¬ 𝐶 ∈ Cat ∧ ¬ 𝐷 ∈ Cat)) → (InitO‘𝐷) = ∅)
56	51, 55	eqtr4d 2801	. . 3 ⊢ (((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) ∧ (¬ 𝐶 ∈ Cat ∧ ¬ 𝐷 ∈ Cat)) → (InitO‘𝐶) = (InitO‘𝐷))
57	43, 45, 56	pm2.61ddan 826	. 2 ⊢ ((𝜑 ∧ (𝐶 ∈ V ∧ 𝐷 ∈ V)) → (InitO‘𝐶) = (InitO‘𝐷))
58	6, 13, 57	pm2.61dda 827	1 ⊢ (𝜑 → (InitO‘𝐶) = (InitO‘𝐷))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!weu 2596  ∀wral 3080  {crab 3416  Vcvv 3454  ∅c0 4281  dom cdm 5658  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Hom chom 17483  Catccat 17888  Hom_f chomf 17890  comp_fccomf 17891  InitOcinito 18206

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-cat 17892  df-homf 17894  df-comf 17895  df-inito 18209

This theorem is used by:  zeroopropd  50698