Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  functhincfun Structured version   Visualization version   GIF version

Theorem functhincfun 51005
Description: A functor to a thin category is determined entirely by the object part. (Contributed by Zhi Wang, 16-Oct-2025.)
Hypotheses
Ref Expression
functhincfun.d (𝜑 → 𝐶 ∈ Cat)
functhincfun.e (𝜑 → 𝐷 ∈ ThinCat)
Assertion
Ref Expression
functhincfun (𝜑 → Fun (𝐶 Func 𝐷))

Proof of Theorem functhincfun
Dummy variables 𝑓 𝑔 ℎ 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 18089 . 2 Rel (𝐶 Func 𝐷)
2 simprl 783 . . . . . . 7 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝑓(𝐶 Func 𝐷)𝑔)
3 eqid 2766 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
4 eqid 2766 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
5 eqid 2766 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
6 eqid 2766 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
7 functhincfun.d . . . . . . . . 9 (𝜑 → 𝐶 ∈ Cat)
87adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝐶 ∈ Cat)
9 functhincfun.e . . . . . . . . 9 (𝜑 → 𝐷 ∈ ThinCat)
109adantr 486 . . . . . . . 8 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝐷 ∈ ThinCat)
113, 4, 2funcf1 18093 . . . . . . . 8 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝑓:(Base‘𝐶)⟶(Base‘𝐷))
12 eqid 2766 . . . . . . . 8 (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))
13 simplrl 789 . . . . . . . . . . 11 (((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑓(𝐶 Func 𝐷)𝑔)
14 simprl 783 . . . . . . . . . . 11 (((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑥 ∈ (Base‘𝐶))
15 simprr 785 . . . . . . . . . . 11 (((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
163, 5, 6, 13, 14, 15funcf2 18095 . . . . . . . . . 10 (((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (𝑥𝑔𝑦):(𝑥(Hom ‘𝐶)𝑦)⟶((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))
1716f002 50386 . . . . . . . . 9 (((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → (((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)) = ∅ → (𝑥(Hom ‘𝐶)𝑦) = ∅))
1817ralrimivva 3212 . . . . . . . 8 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)(((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)) = ∅ → (𝑥(Hom ‘𝐶)𝑦) = ∅))
193, 4, 5, 6, 8, 10, 11, 12, 18functhinc 51004 . . . . . . 7 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → (𝑓(𝐶 Func 𝐷)𝑔 ↔ 𝑔 = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))))
202, 19mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝑔 = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))))
21 simprr 785 . . . . . . 7 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝑓(𝐶 Func 𝐷)ℎ)
223, 4, 5, 6, 8, 10, 11, 12, 18functhinc 51004 . . . . . . 7 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → (𝑓(𝐶 Func 𝐷)ℎ ↔ ℎ = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))))
2321, 22mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → ℎ = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Hom ‘𝐶)𝑦) × ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))))
2420, 23eqtr4d 2804 . . . . 5 ((𝜑 ∧ (𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ)) → 𝑔 = ℎ)
2524ex 418 . . . 4 (𝜑 → ((𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ) → 𝑔 = ℎ))
2625alrimivv 1965 . . 3 (𝜑 → ∀𝑔∀ℎ((𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ) → 𝑔 = ℎ))
2726alrimiv 1964 . 2 (𝜑 → ∀𝑓∀𝑔∀ℎ((𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ) → 𝑔 = ℎ))
28 dffun2 6575 . . 3 (Fun (𝐶 Func 𝐷) ↔ (Rel (𝐶 Func 𝐷) ∧ ∀𝑓∀𝑔∀ℎ((𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ) → 𝑔 = ℎ)))
2928biimpri 231 . 2 ((Rel (𝐶 Func 𝐷) ∧ ∀𝑓∀𝑔∀ℎ((𝑓(𝐶 Func 𝐷)𝑔 ∧ 𝑓(𝐶 Func 𝐷)ℎ) → 𝑔 = ℎ)) → Fun (𝐶 Func 𝐷))
301, 27, 29sylancr 599 1 (𝜑 → Fun (𝐶 Func 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1570   = wceq 1572   ∈ wcel 2150  ∅c0 4280   class class class wbr 5107   × cxp 5655  Rel wrel 5662  Fun wfun 6559  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  Basecbs 17433  Hom chom 17485  Catccat 17890   Func cfunc 18081  ThinCatcthinc 50973
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-1st 8034  df-2nd 8035  df-map 8886  df-ixp 8963  df-cat 17894  df-cid 17895  df-func 18085  df-thinc 50974
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator