Theorem mofmo 49509

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 49478	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐵 ↔ (𝐵 = ∅ ∨ ∃𝑦 𝐵 = {𝑦}))
2		mof02 49501	. . 3 ⊢ (𝐵 = ∅ → ∃*𝑓 𝑓:𝐴⟶𝐵)
3		mofsn2 49507	. . . 4 ⊢ (𝐵 = {𝑦} → ∃*𝑓 𝑓:𝐴⟶𝐵)
4	3	exlimiv 1957	. . 3 ⊢ (∃𝑦 𝐵 = {𝑦} → ∃*𝑓 𝑓:𝐴⟶𝐵)
5	2, 4	jaoi 870	. 2 ⊢ ((𝐵 = ∅ ∨ ∃𝑦 𝐵 = {𝑦}) → ∃*𝑓 𝑓:𝐴⟶𝐵)
6	1, 5	sylbi 220	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐵 → ∃*𝑓 𝑓:𝐴⟶𝐵)

Syntax hints:   → wi 4   ∨ wo 860   = wceq 1567  ∃wex 1806   ∈ wcel 2149  ∃*wmo 2571  ∅c0 4294  {csn 4594  ⟶wf 6533

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545

This theorem is referenced by:  setcthin  50127