Theorem fsetsnprcnex 48328

Description: The class of all functions from a (proper) singleton into a proper class 𝐵 is not a set. (Contributed by AV, 13-Sep-2024.)

Assertion

Ref	Expression
fsetsnprcnex	⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V)

Distinct variable groups:   𝐵,𝑓   𝑆,𝑓

Allowed substitution hint:   𝑉(𝑓)

Proof of Theorem fsetsnprcnex

Dummy variables 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2763	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}}
2		eqid 2763	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}) = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩})
3	1, 2	fsetsnf1o 48327	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}):𝐵⟶1-1onto{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
4		f1ovv 7991	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}):𝐵⟶1-1onto{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
5	3, 4	syl 18	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
6	5	notbid 321	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (¬ 𝐵 ∈ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
7		df-nel 3066	. . . 4 ⊢ (𝐵 ∉ V ↔ ¬ 𝐵 ∈ V)
8		df-nel 3066	. . . 4 ⊢ ({𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V)
9	6, 7, 8	3bitr4g 317	. . 3 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∉ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V))
10	9	biimpa 482	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V)
11		fsetabsnop 48323	. . . 4 ⊢ (𝑆 ∈ 𝑉 → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
12	11	adantr 486	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
13		eqidd 2764	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → V = V)
14	12, 13	neleq12d 3070	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → ({𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V))
15	10, 14	mpbird 260	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741   ∉ wnel 3065  ∃wrex 3090  Vcvv 3454  {csn 4588  ⟨cop 4838   ↦ cmpt 5189  ⟶wf 6551  ⟶1-1ontowf1o 6554

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563

This theorem is used by:  fsetprcnexALT  48335