Theorem functhinc 46214

Description: A functor to a thin category is determined entirely by the object part. The hypothesis "functhinc.1" is related to a monotone function if preorders induced by the categories are considered (catprs2 46181). (Contributed by Zhi Wang, 1-Oct-2024.)

Hypotheses

Ref	Expression
functhinc.b	⊢ 𝐵 = (Base‘𝐷)
functhinc.c	⊢ 𝐶 = (Base‘𝐸)
functhinc.h	⊢ 𝐻 = (Hom ‘𝐷)
functhinc.j	⊢ 𝐽 = (Hom ‘𝐸)
functhinc.d	⊢ (𝜑 → 𝐷 ∈ Cat)
functhinc.e	⊢ (𝜑 → 𝐸 ∈ ThinCat)
functhinc.f	⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
functhinc.k	⊢ 𝐾 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝐻𝑦) × ((𝐹‘𝑥)𝐽(𝐹‘𝑦))))
functhinc.1	⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅ → (𝑧𝐻𝑤) = ∅))

Assertion

Ref	Expression
functhinc	⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ 𝐺 = 𝐾))

Distinct variable groups:   𝑤,𝐹,𝑧   𝑥,𝐹,𝑦   𝑤,𝐻,𝑧   𝑥,𝐻,𝑦   𝑤,𝐽,𝑧   𝑥,𝐽,𝑦   𝑤,𝐵,𝑧   𝑥,𝐵,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝐶(𝑥,𝑦,𝑧,𝑤)   𝐷(𝑥,𝑦,𝑧,𝑤)   𝐸(𝑥,𝑦,𝑧,𝑤)   𝐺(𝑥,𝑦,𝑧,𝑤)   𝐾(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem functhinc

Dummy variables 𝑎 𝑏 𝑐 𝑓 𝑔 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		functhinc.f	. . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶𝐶)
2		functhinc.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐷)
3		functhinc.c	. . . . . 6 ⊢ 𝐶 = (Base‘𝐸)
4		functhinc.h	. . . . . 6 ⊢ 𝐻 = (Hom ‘𝐷)
5		functhinc.j	. . . . . 6 ⊢ 𝐽 = (Hom ‘𝐸)
6		eqid 2738	. . . . . 6 ⊢ (Id‘𝐷) = (Id‘𝐷)
7		eqid 2738	. . . . . 6 ⊢ (Id‘𝐸) = (Id‘𝐸)
8		eqid 2738	. . . . . 6 ⊢ (comp‘𝐷) = (comp‘𝐷)
9		eqid 2738	. . . . . 6 ⊢ (comp‘𝐸) = (comp‘𝐸)
10		functhinc.d	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ Cat)
11		functhinc.e	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ThinCat)
12	11	thinccd 46194	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ Cat)
13	2, 3, 4, 5, 6, 7, 8, 9, 10, 12	isfunc 17495	. . . . 5 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶𝐶 ∧ 𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))))
14		3anass 1093	. . . . 5 ⊢ ((𝐹:𝐵⟶𝐶 ∧ 𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓)))) ↔ (𝐹:𝐵⟶𝐶 ∧ (𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))))
15	13, 14	bitrdi 286	. . . 4 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐹:𝐵⟶𝐶 ∧ (𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓)))))))
16	1, 15	mpbirand 703	. . 3 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))))
17		funcf2lem 46187	. . . . 5 ⊢ (𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ↔ (𝐺 ∈ V ∧ 𝐺 Fn (𝐵 × 𝐵) ∧ ∀𝑣 ∈ 𝐵 ∀𝑢 ∈ 𝐵 (𝑣𝐺𝑢):(𝑣𝐻𝑢)⟶((𝐹‘𝑣)𝐽(𝐹‘𝑢))))
18		functhinc.k	. . . . . 6 ⊢ 𝐾 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥𝐻𝑦) × ((𝐹‘𝑥)𝐽(𝐹‘𝑦))))
19		simprl 767	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵)) → 𝑣 ∈ 𝐵)
20		simprr 769	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵)) → 𝑢 ∈ 𝐵)
21		functhinc.1	. . . . . . . 8 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅ → (𝑧𝐻𝑤) = ∅))
22	21	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵)) → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝐹‘𝑧)𝐽(𝐹‘𝑤)) = ∅ → (𝑧𝐻𝑤) = ∅))
23	19, 20, 22	functhinclem2 46211	. . . . . 6 ⊢ ((𝜑 ∧ (𝑣 ∈ 𝐵 ∧ 𝑢 ∈ 𝐵)) → (((𝐹‘𝑣)𝐽(𝐹‘𝑢)) = ∅ → (𝑣𝐻𝑢) = ∅))
24	2, 3, 4, 5, 11, 1, 18, 23	functhinclem1 46210	. . . . 5 ⊢ (𝜑 → ((𝐺 ∈ V ∧ 𝐺 Fn (𝐵 × 𝐵) ∧ ∀𝑣 ∈ 𝐵 ∀𝑢 ∈ 𝐵 (𝑣𝐺𝑢):(𝑣𝐻𝑢)⟶((𝐹‘𝑣)𝐽(𝐹‘𝑢))) ↔ 𝐺 = 𝐾))
25	17, 24	syl5bb 282	. . . 4 ⊢ (𝜑 → (𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ↔ 𝐺 = 𝐾))
26	25	anbi1d 629	. . 3 ⊢ (𝜑 → ((𝐺 ∈ X𝑐 ∈ (𝐵 × 𝐵)(((𝐹‘(1st ‘𝑐))𝐽(𝐹‘(2nd ‘𝑐))) ↑m (𝐻‘𝑐)) ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓)))) ↔ (𝐺 = 𝐾 ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))))
27	16, 26	bitrd 278	. 2 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ (𝐺 = 𝐾 ∧ ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))))
28	2, 3, 4, 5, 10, 11, 1, 18, 21, 6, 7, 8, 9	functhinclem4 46213	. 2 ⊢ ((𝜑 ∧ 𝐺 = 𝐾) → ∀𝑎 ∈ 𝐵 (((𝑎𝐺𝑎)‘((Id‘𝐷)‘𝑎)) = ((Id‘𝐸)‘(𝐹‘𝑎)) ∧ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 ∀𝑓 ∈ (𝑎𝐻𝑏)∀𝑔 ∈ (𝑏𝐻𝑐)((𝑎𝐺𝑐)‘(𝑔(⟨𝑎, 𝑏⟩(comp‘𝐷)𝑐)𝑓)) = (((𝑏𝐺𝑐)‘𝑔)(⟨(𝐹‘𝑎), (𝐹‘𝑏)⟩(comp‘𝐸)(𝐹‘𝑐))((𝑎𝐺𝑏)‘𝑓))))
29	27, 28	mpbiran3d 46030	1 ⊢ (𝜑 → (𝐹(𝐷 Func 𝐸)𝐺 ↔ 𝐺 = 𝐾))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  Vcvv 3422  ∅c0 4253  ⟨cop 4564   class class class wbr 5070   × cxp 5578   Fn wfn 6413  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255   ∈ cmpo 7257  1^st c1st 7802  2^nd c2nd 7803   ↑_m cmap 8573  Xcixp 8643  Basecbs 16840  Hom chom 16899  compcco 16900  Catccat 17290  Idccid 17291   Func cfunc 17485  ThinCatcthinc 46188

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-map 8575  df-ixp 8644  df-cat 17294  df-cid 17295  df-func 17489  df-thinc 46189

This theorem is referenced by:  thincciso  46218