Theorem eufsn 50061

Description: There is exactly one function into a singleton, assuming ax-rep 5231. See eufsn2 50062 for different axiom requirements. If existence is not needed, use mofsn 50063 or mofsn2 50064 for fewer axiom assumptions. (Contributed by Zhi Wang, 19-Sep-2024.)

Hypotheses

Ref	Expression
eufsn.1	⊢ (𝜑 → 𝐵 ∈ 𝑊)
eufsn.2	⊢ (𝜑 → 𝐴 ∈ 𝑉)

Assertion

Ref	Expression
eufsn	⊢ (𝜑 → ∃!𝑓 𝑓:𝐴⟶{𝐵})

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

Allowed substitution hints:   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem eufsn

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eufsn.1	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
2		eufsn.2	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		fconstmpt 5713	. . . 4 ⊢ (𝐴 × {𝐵}) = (𝑥 ∈ 𝐴 ↦ 𝐵)
4		mptexg 7231	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
5	3, 4	eqeltrid 2864	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 × {𝐵}) ∈ V)
6	2, 5	syl 18	. 2 ⊢ (𝜑 → (𝐴 × {𝐵}) ∈ V)
7	1, 6	eufsnlem 50060	1 ⊢ (𝜑 → ∃!𝑓 𝑓:𝐴⟶{𝐵})

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2144  ∃!weu 2593  Vcvv 3450  {csn 4584   ↦ cmpt 5185   × cxp 5649  ⟶wf 6539

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551

This theorem is used by: (None)