Theorem thincpropd 49929

Description: Two structures with the same base, hom-sets and composition operation are either both thin categories or neither. (Contributed by Zhi Wang, 16-Oct-2025.)

Hypotheses

Ref	Expression
thincpropd.1	⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
thincpropd.2	⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
thincpropd.3	⊢ (𝜑 → 𝐶 ∈ 𝑉)
thincpropd.4	⊢ (𝜑 → 𝐷 ∈ 𝑊)

Assertion

Ref	Expression
thincpropd	⊢ (𝜑 → (𝐶 ∈ ThinCat ↔ 𝐷 ∈ ThinCat))

Proof of Theorem thincpropd

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

Step	Hyp	Ref	Expression
1		thincpropd.1	. . . 4 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
2		thincpropd.2	. . . 4 ⊢ (𝜑 → (compf‘𝐶) = (compf‘𝐷))
3		thincpropd.3	. . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑉)
4		thincpropd.4	. . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑊)
5	1, 2, 3, 4	catpropd 17666	. . 3 ⊢ (𝜑 → (𝐶 ∈ Cat ↔ 𝐷 ∈ Cat))
6		eqid 2737	. . . . . . . 8 ⊢ (Base‘𝐶) = (Base‘𝐶)
7		eqid 2737	. . . . . . . 8 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
8		eqid 2737	. . . . . . . 8 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
9	1	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (Homf ‘𝐶) = (Homf ‘𝐷))
10		simprl 771	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑥 ∈ (Base‘𝐶))
11		simprr 773	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
12	6, 7, 8, 9, 10, 11	homfeqval 17654	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥(Hom ‘𝐶)𝑦) = (𝑥(Hom ‘𝐷)𝑦))
13	12	eleq2d 2823	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ↔ 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
14	13	mobidv 2550	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ↔ ∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
15	14	2ralbidva 3200	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ↔ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
16	1	homfeqbas 17653	. . . . 5 ⊢ (𝜑 → (Base‘𝐶) = (Base‘𝐷))
17	16	raleqdv 3296	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦) ↔ ∀𝑦 ∈ (Base‘𝐷)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
18	16, 17	raleqbidv 3312	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦) ↔ ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
19	15, 18	bitrd 279	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ↔ ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
20	5, 19	anbi12d 633	. 2 ⊢ (𝜑 → ((𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)) ↔ (𝐷 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦))))
21	6, 7	isthinc 49906	. 2 ⊢ (𝐶 ∈ ThinCat ↔ (𝐶 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦)))
22		eqid 2737	. . 3 ⊢ (Base‘𝐷) = (Base‘𝐷)
23	22, 8	isthinc 49906	. 2 ⊢ (𝐷 ∈ ThinCat ↔ (𝐷 ∈ Cat ∧ ∀𝑥 ∈ (Base‘𝐷)∀𝑦 ∈ (Base‘𝐷)∃*𝑓 𝑓 ∈ (𝑥(Hom ‘𝐷)𝑦)))
24	20, 21, 23	3bitr4g 314	1 ⊢ (𝜑 → (𝐶 ∈ ThinCat ↔ 𝐷 ∈ ThinCat))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃*wmo 2538  ∀wral 3052  ‘cfv 6492  (class class class)co 7360  Basecbs 17170  Hom chom 17222  Catccat 17621  Hom_f chomf 17623  comp_fccomf 17624  ThinCatcthinc 49904

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-cat 17625  df-homf 17627  df-comf 17628  df-thinc 49905

This theorem is referenced by:  termcpropd  49990