Theorem fsetsnprcnex 47820

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 2762	. . . . . . 7 ⊢ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}}
2		eqid 2762	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}) = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩})
3	1, 2	fsetsnf1o 47819	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}):𝐵–1-1-onto→{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
4		f1ovv 7953	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}):𝐵–1-1-onto→{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
5	3, 4	syl 18	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
6	5	notbid 321	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (¬ 𝐵 ∈ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V))
7		df-nel 3064	. . . 4 ⊢ (𝐵 ∉ V ↔ ¬ 𝐵 ∈ V)
8		df-nel 3064	. . . 4 ⊢ ({𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∈ V)
9	6, 7, 8	3bitr4g 317	. . 3 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∉ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V))
10	9	biimpa 481	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}} ∉ V)
11		fsetabsnop 47815	. . . 4 ⊢ (𝑆 ∈ 𝑉 → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
12	11	adantr 485	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}})
13		eqidd 2763	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → V = V)
14	12, 13	neleq12d 3068	. 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 400   = wceq 1569   ∈ wcel 2142  {cab 2740   ∉ wnel 3063  ∃wrex 3088  Vcvv 3454  {csn 4588  ⟨cop 4594   ↦ cmpt 5191  ⟶wf 6532  –1-1-onto→wf1o 6535

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544

This theorem is used by:  fsetprcnexALT  47827