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 49083
Description: Alternate proof of 0func 49082. (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 17769 . 2 Rel (∅ Func 𝐶)
2 0ex 5246 . . 3 ∅ ∈ V
32, 2relsnop 5748 . 2 Rel {⟨∅, ∅⟩}
4 base0 17125 . . . . 5 ∅ = (Base‘∅)
5 eqid 2729 . . . . 5 (Base‘𝐶) = (Base‘𝐶)
6 eqid 2729 . . . . 5 (Hom ‘∅) = (Hom ‘∅)
7 eqid 2729 . . . . 5 (Hom ‘𝐶) = (Hom ‘𝐶)
8 eqid 2729 . . . . 5 (Id‘∅) = (Id‘∅)
9 eqid 2729 . . . . 5 (Id‘𝐶) = (Id‘𝐶)
10 eqid 2729 . . . . 5 (comp‘∅) = (comp‘∅)
11 eqid 2729 . . . . 5 (comp‘𝐶) = (comp‘𝐶)
12 0cat 17595 . . . . . 6 ∅ ∈ Cat
1312a1i 11 . . . . 5 (𝜑 → ∅ ∈ Cat)
14 0func.c . . . . 5 (𝜑𝐶 ∈ Cat)
154, 5, 6, 7, 8, 9, 10, 11, 13, 14isfunc 17771 . . . 4 (𝜑 → (𝑓(∅ Func 𝐶)𝑔 ↔ (𝑓:∅⟶(Base‘𝐶) ∧ 𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ∧ ∀𝑥 ∈ ∅ (((𝑥𝑔𝑥)‘((Id‘∅)‘𝑥)) = ((Id‘𝐶)‘(𝑓𝑥)) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑚 ∈ (𝑥(Hom ‘∅)𝑦)∀𝑛 ∈ (𝑦(Hom ‘∅)𝑧)((𝑥𝑔𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘∅)𝑧)𝑚)) = (((𝑦𝑔𝑧)‘𝑛)(⟨(𝑓𝑥), (𝑓𝑦)⟩(comp‘𝐶)(𝑓𝑧))((𝑥𝑔𝑦)‘𝑚))))))
16 f0bi 6707 . . . 4 (𝑓:∅⟶(Base‘𝐶) ↔ 𝑓 = ∅)
17 ral0 4464 . . . . . 6 𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑔𝑦):(𝑥(Hom ‘∅)𝑦)⟶((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))
184funcf2lem2 49077 . . . . . 6 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ (𝑔 Fn (∅ × ∅) ∧ ∀𝑥 ∈ ∅ ∀𝑦 ∈ ∅ (𝑥𝑔𝑦):(𝑥(Hom ‘∅)𝑦)⟶((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))))
1917, 18mpbiran2 710 . . . . 5 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ 𝑔 Fn (∅ × ∅))
20 0xp 5718 . . . . . 6 (∅ × ∅) = ∅
2120fneq2i 6580 . . . . 5 (𝑔 Fn (∅ × ∅) ↔ 𝑔 Fn ∅)
22 fn0 6613 . . . . 5 (𝑔 Fn ∅ ↔ 𝑔 = ∅)
2319, 21, 223bitri 297 . . . 4 (𝑔X𝑧 ∈ (∅ × ∅)(((𝑓‘(1st𝑧))(Hom ‘𝐶)(𝑓‘(2nd𝑧))) ↑m ((Hom ‘∅)‘𝑧)) ↔ 𝑔 = ∅)
24 ral0 4464 . . . 4 𝑥 ∈ ∅ (((𝑥𝑔𝑥)‘((Id‘∅)‘𝑥)) = ((Id‘𝐶)‘(𝑓𝑥)) ∧ ∀𝑦 ∈ ∅ ∀𝑧 ∈ ∅ ∀𝑚 ∈ (𝑥(Hom ‘∅)𝑦)∀𝑛 ∈ (𝑦(Hom ‘∅)𝑧)((𝑥𝑔𝑧)‘(𝑛(⟨𝑥, 𝑦⟩(comp‘∅)𝑧)𝑚)) = (((𝑦𝑔𝑧)‘𝑛)(⟨(𝑓𝑥), (𝑓𝑦)⟩(comp‘𝐶)(𝑓𝑧))((𝑥𝑔𝑦)‘𝑚)))
2515, 16, 23, 240funclem 49081 . . 3 (𝜑 → (𝑓(∅ Func 𝐶)𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅)))
26 brsnop 5465 . . . 4 ((∅ ∈ V ∧ ∅ ∈ V) → (𝑓{⟨∅, ∅⟩}𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅)))
272, 2, 26mp2an 692 . . 3 (𝑓{⟨∅, ∅⟩}𝑔 ↔ (𝑓 = ∅ ∧ 𝑔 = ∅))
2825, 27bitr4di 289 . 2 (𝜑 → (𝑓(∅ Func 𝐶)𝑔𝑓{⟨∅, ∅⟩}𝑔))
291, 3, 28eqbrrdiv 5737 1 (𝜑 → (∅ Func 𝐶) = {⟨∅, ∅⟩})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3044  Vcvv 3436  c0 4284  {csn 4577  cop 4583   class class class wbr 5092   × cxp 5617   Fn wfn 6477  wf 6478  cfv 6482  (class class class)co 7349  1st c1st 7922  2nd c2nd 7923  m cmap 8753  Xcixp 8824  Basecbs 17120  Hom chom 17172  compcco 17173  Catccat 17570  Idccid 17571   Func cfunc 17761
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-1cn 11067  ax-addcl 11069
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-map 8755  df-ixp 8825  df-nn 12129  df-slot 17093  df-ndx 17105  df-base 17121  df-cat 17574  df-func 17765
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator