Theorem mofmo 49775

Description: There is at most one function into a class containing at most one element. (Contributed by Zhi Wang, 19-Sep-2024.)

Assertion

Ref	Expression
mofmo	⊢ (∃*𝑥 𝑥 ∈ 𝐵 → ∃*𝑓 𝑓:𝐴⟶𝐵)

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓,𝑥

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem mofmo

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mo0sn 49744	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐵 ↔ (𝐵 = ∅ ∨ ∃𝑦 𝐵 = {𝑦}))
2		mof02 49767	. . 3 ⊢ (𝐵 = ∅ → ∃*𝑓 𝑓:𝐴⟶𝐵)
3		mofsn2 49773	. . . 4 ⊢ (𝐵 = {𝑦} → ∃*𝑓 𝑓:𝐴⟶𝐵)
4	3	exlimiv 1963	. . 3 ⊢ (∃𝑦 𝐵 = {𝑦} → ∃*𝑓 𝑓:𝐴⟶𝐵)
5	2, 4	jaoi 871	. 2 ⊢ ((𝐵 = ∅ ∨ ∃𝑦 𝐵 = {𝑦}) → ∃*𝑓 𝑓:𝐴⟶𝐵)
6	1, 5	sylbi 220	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐵 → ∃*𝑓 𝑓:𝐴⟶𝐵)

This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃*wmo 2562  ∅c0 4279  {csn 4584  ⟶wf 6529

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-sep 5251  ax-nul 5263  ax-pr 5398

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-rmo 3365  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-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  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-fv 6541

This theorem is used by:  setcthin  50391