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

Theorem homf0 49936
Description: The base is empty iff the functionalized Hom-set operation is empty. (Contributed by Zhi Wang, 23-Oct-2025.)
Assertion
Ref Expression
homf0 ((Base‘𝐶) = ∅ ↔ (Homf𝐶) = ∅)

Proof of Theorem homf0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . 4 (Homf𝐶) = (Homf𝐶)
2 eqid 2760 . . . 4 (Base‘𝐶) = (Base‘𝐶)
3 eqid 2760 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
41, 2, 3homffval 17779 . . 3 (Homf𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥(Hom ‘𝐶)𝑦))
5 0mpo0 7497 . . . 4 (((Base‘𝐶) = ∅ ∨ (Base‘𝐶) = ∅) → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥(Hom ‘𝐶)𝑦)) = ∅)
65orcs 889 . . 3 ((Base‘𝐶) = ∅ → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ (𝑥(Hom ‘𝐶)𝑦)) = ∅)
74, 6eqtrid 2807 . 2 ((Base‘𝐶) = ∅ → (Homf𝐶) = ∅)
81, 2homffn 17782 . . . 4 (Homf𝐶) Fn ((Base‘𝐶) × (Base‘𝐶))
9 f0bi 6759 . . . . 5 ((Homf𝐶):∅⟶∅ ↔ (Homf𝐶) = ∅)
10 ffn 6703 . . . . 5 ((Homf𝐶):∅⟶∅ → (Homf𝐶) Fn ∅)
119, 10sylbir 238 . . . 4 ((Homf𝐶) = ∅ → (Homf𝐶) Fn ∅)
12 fndmu 6640 . . . 4 (((Homf𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ∧ (Homf𝐶) Fn ∅) → ((Base‘𝐶) × (Base‘𝐶)) = ∅)
138, 11, 12sylancr 599 . . 3 ((Homf𝐶) = ∅ → ((Base‘𝐶) × (Base‘𝐶)) = ∅)
14 xpeq0 6152 . . . 4 (((Base‘𝐶) × (Base‘𝐶)) = ∅ ↔ ((Base‘𝐶) = ∅ ∨ (Base‘𝐶) = ∅))
15 pm4.25 919 . . . 4 ((Base‘𝐶) = ∅ ↔ ((Base‘𝐶) = ∅ ∨ (Base‘𝐶) = ∅))
1614, 15bitr4i 281 . . 3 (((Base‘𝐶) × (Base‘𝐶)) = ∅ ↔ (Base‘𝐶) = ∅)
1713, 16sylib 221 . 2 ((Homf𝐶) = ∅ → (Base‘𝐶) = ∅)
187, 17impbii 212 1 ((Base‘𝐶) = ∅ ↔ (Homf𝐶) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wo 861   = wceq 1570  c0 4279   × cxp 5653   Fn wfn 6528  wf 6529  cfv 6533  (class class class)co 7414  cmpo 7416  Basecbs 17302  Hom chom 17354  Homf chomf 17755
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-homf 17759
This theorem is used by:  initopropdlem  50167  termopropdlem  50168
  Copyright terms: Public domain W3C validator