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

Theorem 0funcALT 49436
Description: Alternate proof of 0func 49435. (Contributed by Zhi Wang, 7-Oct-2025.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
0func.c (𝜑𝐶 ∈ Cat)
Assertion
Ref Expression
0funcALT (𝜑 → (∅ Func 𝐶) = {⟨∅, ∅⟩})

Proof of Theorem 0funcALT
Dummy variables 𝑓 𝑔 𝑚 𝑛 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 17798 . 2 Rel (∅ Func 𝐶)
2 0ex 5254 . . 3 ∅ ∈ V
32, 2relsnop 5762 . 2 Rel {⟨∅, ∅⟩}
4 base0 17153 . . . . 5 ∅ = (Base‘∅)
5 eqid 2737 . . . . 5 (Base‘𝐶) = (Base‘𝐶)
6 eqid 2737 . . . . 5 (Hom ‘∅) = (Hom ‘∅)
7 eqid 2737 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
8 eqid 2737 . . . . 5 (Id‘∅) = (Id‘∅)
9 eqid 2737 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
10 eqid 2737 . . . . 5 (comp‘∅) = (comp‘∅)
11 eqid 2737 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
12 0cat 17624 . . . . . 6 ∅ ∈ Cat
1312a1i 11 . . . . 5 (𝜑 → ∅ ∈ Cat)
14 0func.c . . . . 5 (𝜑𝐶 ∈ Cat)
154, 5, 6, 7, 8, 9, 10, 11, 13, 14isfunc 17800 . . . 4 (𝜑 → (𝑓(∅ Func 𝐶)𝑔 ↔ (𝑓:∅⟶(Base‘𝐶) ∧ 𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ∧ ∀𝑥 ∈ ∅ (((𝑥𝑔𝑥)‘((Id‘∅)‘𝑥)) = ((Id‘𝐶)‘(𝑓𝑥)) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑚 ∈ (𝑥(Hom ‘∅)𝑦)∀𝑛 ∈ (𝑦(Hom ‘∅)𝑧)((𝑥𝑔𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘∅)𝑧)𝑚)) = (((𝑦𝑔𝑧)‘𝑛)(⟨(𝑓𝑥), (𝑓𝑦)⟩(comp‘𝐶)(𝑓𝑧))((𝑥𝑔𝑦)‘𝑚))))))
16 f0bi 6725 . . . 4 (𝑓:∅⟶(Base‘𝐶) ↔ 𝑓 = ∅)
17 ral0 4453 . . . . . 6 𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑔𝑦):(𝑥(Hom ‘∅)𝑦)⟶((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))
184funcf2lem2 49430 . . . . . 6 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ (𝑔 Fn (∅ × ∅) ∧ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑔𝑦):(𝑥(Hom ‘∅)𝑦)⟶((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))))
1917, 18mpbiran2 711 . . . . 5 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ 𝑔 Fn (∅ × ∅))
20 0xp 5731 . . . . . 6 (∅ × ∅) = ∅
2120fneq2i 6598 . . . . 5 (𝑔 Fn (∅ × ∅) ↔ 𝑔 Fn ∅)
22 fn0 6631 . . . . 5 (𝑔 Fn ∅ ↔ 𝑔 = ∅)
2319, 21, 223bitri 297 . . . 4 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ 𝑔 = ∅)
24 ral0 4453 . . . 4 𝑥 ∈ ∅ (((𝑥𝑔𝑥)‘((Id‘∅)‘𝑥)) = ((Id‘𝐶)‘(𝑓𝑥)) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑚 ∈ (𝑥(Hom ‘∅)𝑦)∀𝑛 ∈ (𝑦(Hom ‘∅)𝑧)((𝑥𝑔𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘∅)𝑧)𝑚)) = (((𝑦𝑔𝑧)‘𝑛)(⟨(𝑓𝑥), (𝑓𝑦)⟩(comp‘𝐶)(𝑓𝑧))((𝑥𝑔𝑦)‘𝑚)))
2515, 16, 23, 240funclem 49434 . . 3 (𝜑 → (𝑓(∅ Func 𝐶)𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅)))
26 brsnop 5478 . . . 4 ((∅ ∈ V ∧ ∅ ∈ V) → (𝑓{⟨∅, ∅⟩}𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅)))
272, 2, 26mp2an 693 . . 3 (𝑓{⟨∅, ∅⟩}𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅))
2825, 27bitr4di 289 . 2 (𝜑 → (𝑓(∅ Func 𝐶)𝑔𝑓{⟨∅, ∅⟩}𝑔))
291, 3, 28eqbrrdiv 5751 1 (𝜑 → (∅ Func 𝐶) = {⟨∅, ∅⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3442  c0 4287  {csn 4582  cop 4588   class class class wbr 5100   × cxp 5630   Fn wfn 6495  wf 6496  cfv 6500  (class class class)co 7368  1st c1st 7941  2nd c2nd 7942  m cmap 8775  Xcixp 8847  Basecbs 17148  Hom chom 17200  compcco 17201  Catccat 17599  Idccid 17600   Func cfunc 17790
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-1cn 11096  ax-addcl 11098
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-map 8777  df-ixp 8848  df-nn 12158  df-slot 17121  df-ndx 17133  df-base 17149  df-cat 17603  df-func 17794
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator