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

Theorem diag2f1o 51096
Description: If 𝐷 is terminal, the morphism part of a diagonal functor is bijective functions from hom-sets into sets of natural transformations. (Contributed by Zhi Wang, 21-Oct-2025.)
Hypotheses
Ref Expression
diag2f1o.l 𝐿 = (𝐶Δfunc𝐷)
diag2f1o.a 𝐴 = (Base‘𝐶)
diag2f1o.h 𝐻 = (Hom ‘𝐶)
diag2f1o.x (𝜑 → 𝑋 ∈ 𝐴)
diag2f1o.y (𝜑 → 𝑌 ∈ 𝐴)
diag2f1o.n 𝑁 = (𝐷 Nat 𝐶)
diag2f1o.d (𝜑 → 𝐷 ∈ TermCat)
diag2f1o.c (𝜑 → 𝐶 ∈ Cat)
Assertion
Ref Expression
diag2f1o (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))

Proof of Theorem diag2f1o
Dummy variables 𝑓 𝑚 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 diag2f1o.l . . 3 𝐿 = (𝐶Δfunc𝐷)
2 diag2f1o.a . . 3 𝐴 = (Base‘𝐶)
3 eqid 2766 . . 3 (Base‘𝐷) = (Base‘𝐷)
4 diag2f1o.h . . 3 𝐻 = (Hom ‘𝐶)
5 diag2f1o.c . . 3 (𝜑 → 𝐶 ∈ Cat)
6 diag2f1o.d . . . 4 (𝜑 → 𝐷 ∈ TermCat)
76termccatd 51035 . . 3 (𝜑 → 𝐷 ∈ Cat)
8 diag2f1o.x . . 3 (𝜑 → 𝑋 ∈ 𝐴)
9 diag2f1o.y . . 3 (𝜑 → 𝑌 ∈ 𝐴)
103istermc2 51031 . . . . . . 7 (𝐷 ∈ TermCat ↔ (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
116, 10sylib 221 . . . . . 6 (𝜑 → (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
1211simprd 501 . . . . 5 (𝜑 → ∃!𝑧 𝑧 ∈ (Base‘𝐷))
13 euex 2608 . . . . 5 (∃!𝑧 𝑧 ∈ (Base‘𝐷) → ∃𝑧 𝑧 ∈ (Base‘𝐷))
1412, 13syl 18 . . . 4 (𝜑 → ∃𝑧 𝑧 ∈ (Base‘𝐷))
15 n0 4302 . . . 4 ((Base‘𝐷) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (Base‘𝐷))
1614, 15sylibr 237 . . 3 (𝜑 → (Base‘𝐷) ≠ ∅)
17 diag2f1o.n . . 3 𝑁 = (𝐷 Nat 𝐶)
181, 2, 3, 4, 5, 7, 8, 9, 16, 17diag2f1 50852 . 2 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
19 f1f 6807 . . . 4 ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
2018, 19syl 18 . . 3 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
216, 3termcbas 51036 . . . . . 6 (𝜑 → ∃𝑧(Base‘𝐷) = {𝑧})
2221adantr 486 . . . . 5 ((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) → ∃𝑧(Base‘𝐷) = {𝑧})
23 fveq2 6915 . . . . . . 7 (𝑓 = (𝑚‘𝑧) → ((𝑋(2nd ‘𝐿)𝑌)‘𝑓) = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
2423eqeq2d 2777 . . . . . 6 (𝑓 = (𝑚‘𝑧) → (𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓) ↔ 𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧))))
258ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑋 ∈ 𝐴)
269ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑌 ∈ 𝐴)
276ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝐷 ∈ TermCat)
28 simplr 781 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
29 vsnid 4624 . . . . . . . . 9 𝑧 ∈ {𝑧}
30 simpr 490 . . . . . . . . 9 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → (Base‘𝐷) = {𝑧})
3129, 30eleqtrrid 2874 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑧 ∈ (Base‘𝐷))
32 eqid 2766 . . . . . . . 8 (𝑚‘𝑧) = (𝑚‘𝑧)
331, 2, 4, 25, 26, 17, 27, 28, 3, 31, 32diag2f1olem 51095 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ((𝑚‘𝑧) ∈ (𝑋𝐻𝑌) ∧ 𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧))))
3433simpld 500 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → (𝑚‘𝑧) ∈ (𝑋𝐻𝑌))
3533simprd 501 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
3624, 34, 35rspcedvdw 3582 . . . . 5 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
3722, 36exlimddv 1972 . . . 4 ((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
3837ralrimiva 3161 . . 3 (𝜑 → ∀𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
39 dffo3 7133 . . 3 ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ↔ ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ∧ ∀𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓)))
4020, 38, 39sylanbrc 595 . 2 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
41 df-f1o 6572 . 2 ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ↔ ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ∧ (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))))
4218, 40, 41sylanbrc 595 1 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  ∃!weu 2599   ≠ wne 2962  ∀wral 3083  ∃wrex 3093  ∅c0 4280  {csn 4587  ⟶wf 6561  ⟶1-1wf1 6562  ⟶ontowfo 6563  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450  1st c1st 8032  2nd c2nd 8033  Basecbs 17433  Hom chom 17485  Catccat 17890   Nat cnat 18171  Δfunccdiag 18438  ThinCatcthinc 50973  TermCatctermc 51028
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  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  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-nel 3069  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-pss 4016  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-tp 4592  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  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-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  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-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-ixp 8963  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-struct 17371  df-slot 17406  df-ndx 17418  df-base 17434  df-hom 17499  df-cco 17500  df-cat 17894  df-cid 17895  df-func 18085  df-nat 18173  df-fuc 18174  df-xpc 18398  df-1stf 18399  df-curf 18440  df-diag 18442  df-thinc 50974  df-termc 51029
This theorem is used by:  diagffth  51097
  Copyright terms: Public domain W3C validator