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 50878
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 2763 . . 3 (Base‘𝐷) = (Base‘𝐷)
4 diag2f1o.h . . 3 𝐻 = (Hom ‘𝐶)
5 diag2f1o.c . . 3 (𝜑 → 𝐶 ∈ Cat)
6 diag2f1o.d . . . 4 (𝜑 → 𝐷 ∈ TermCat)
76termccatd 50817 . . 3 (𝜑 → 𝐷 ∈ Cat)
8 diag2f1o.x . . 3 (𝜑 → 𝑋 ∈ 𝐴)
9 diag2f1o.y . . 3 (𝜑 → 𝑌 ∈ 𝐴)
103istermc2 50813 . . . . . . 7 (𝐷 ∈ TermCat ↔ (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
116, 10sylib 221 . . . . . 6 (𝜑 → (𝐷 ∈ ThinCat ∧ ∃!𝑧 𝑧 ∈ (Base‘𝐷)))
1211simprd 501 . . . . 5 (𝜑 → ∃!𝑧 𝑧 ∈ (Base‘𝐷))
13 euex 2605 . . . . 5 (∃!𝑧 𝑧 ∈ (Base‘𝐷) → ∃𝑧 𝑧 ∈ (Base‘𝐷))
1412, 13syl 18 . . . 4 (𝜑 → ∃𝑧 𝑧 ∈ (Base‘𝐷))
15 n0 4303 . . . 4 ((Base‘𝐷) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (Base‘𝐷))
1614, 15sylibr 237 . . 3 (𝜑 → (Base‘𝐷) ≠ ∅)
17 diag2f1o.n . . 3 𝑁 = (𝐷 Nat 𝐶)
181, 2, 3, 4, 5, 7, 8, 9, 16, 17diag2f1 50634 . 2 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
19 f1f 6797 . . . 4 ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶1-1(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
2018, 19syl 18 . . 3 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
216, 3termcbas 50818 . . . . . 6 (𝜑 → ∃𝑧(Base‘𝐷) = {𝑧})
2221adantr 486 . . . . 5 ((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) → ∃𝑧(Base‘𝐷) = {𝑧})
23 fveq2 6905 . . . . . . 7 (𝑓 = (𝑚‘𝑧) → ((𝑋(2nd ‘𝐿)𝑌)‘𝑓) = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
2423eqeq2d 2774 . . . . . 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 2871 . . . . . . . 8 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑧 ∈ (Base‘𝐷))
32 eqid 2763 . . . . . . . 8 (𝑚‘𝑧) = (𝑚‘𝑧)
331, 2, 4, 25, 26, 17, 27, 28, 3, 31, 32diag2f1olem 50877 . . . . . . 7 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ((𝑚‘𝑧) ∈ (𝑋𝐻𝑌) ∧ 𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧))))
3433simpld 500 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → (𝑚‘𝑧) ∈ (𝑋𝐻𝑌))
3533simprd 501 . . . . . 6 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → 𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘(𝑚‘𝑧)))
3624, 34, 35rspcedvdw 3583 . . . . 5 (((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) ∧ (Base‘𝐷) = {𝑧}) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
3722, 36exlimddv 1970 . . . 4 ((𝜑 ∧ 𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))) → ∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
3837ralrimiva 3158 . . 3 (𝜑 → ∀𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓))
39 dffo3 7123 . . 3 ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ↔ ((𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)) ∧ ∀𝑚 ∈ (((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌))∃𝑓 ∈ (𝑋𝐻𝑌)𝑚 = ((𝑋(2nd ‘𝐿)𝑌)‘𝑓)))
4020, 38, 39sylanbrc 595 . 2 (𝜑 → (𝑋(2nd ‘𝐿)𝑌):(𝑋𝐻𝑌)⟶onto(((1st ‘𝐿)‘𝑋)𝑁((1st ‘𝐿)‘𝑌)))
41 df-f1o 6562 . 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 1570  ∃wex 1812   ∈ wcel 2147  ∃!weu 2596   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  ∅c0 4281  {csn 4588  ⟶wf 6551  ⟶1-1wf1 6552  ⟶ontowfo 6553  ⟶1-1ontowf1o 6554  ‘cfv 6555  (class class class)co 7440  1st c1st 8020  2nd c2nd 8021  Basecbs 17413  Hom chom 17465  Catccat 17864   Nat cnat 18145  Δfunccdiag 18412  ThinCatcthinc 50755  TermCatctermc 50810
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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-er 8742  df-map 8874  df-ixp 8951  df-en 8999  df-dom 9000  df-sdom 9001  df-fin 9002  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-2 12429  df-3 12430  df-4 12431  df-5 12432  df-6 12433  df-7 12434  df-8 12435  df-9 12436  df-n0 12631  df-z 12718  df-dec 12839  df-uz 12990  df-fz 13664  df-struct 17351  df-slot 17386  df-ndx 17398  df-base 17414  df-hom 17478  df-cco 17479  df-cat 17868  df-cid 17869  df-func 18059  df-nat 18147  df-fuc 18148  df-xpc 18372  df-1stf 18373  df-curf 18414  df-diag 18416  df-thinc 50756  df-termc 50811
This theorem is used by:  diagffth  50879
  Copyright terms: Public domain W3C validator