Theorem fsetprcnex 8898

Description: The class of all functions from a nonempty set 𝐴 into a proper class 𝐵 is not a set. If one of the preconditions is not fufilled, then {𝑓 ∣ 𝑓:𝐴⟶𝐵} is a set, see fsetdmprc0 8891 for 𝐴 ∉ V, fset0 8890 for 𝐴 = ∅, and fsetex 8892 for 𝐵 ∈ V, see also fsetexb 8900. (Contributed by AV, 14-Sep-2024.) (Proof shortened by BJ, 15-Sep-2024.)

Assertion

Ref	Expression
fsetprcnex	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Allowed substitution hint:   𝑉(𝑓)

Proof of Theorem fsetprcnex

Dummy variables 𝑎 𝑔 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4303	. . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑎 𝑎 ∈ 𝐴)
2		feq1 6698	. . . . . . . . . 10 ⊢ (𝑓 = 𝑚 → (𝑓:𝐴⟶𝐵 ↔ 𝑚:𝐴⟶𝐵))
3	2	cbvabv 2834	. . . . . . . . 9 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} = {𝑚 ∣ 𝑚:𝐴⟶𝐵}
4		fveq1 6895	. . . . . . . . . 10 ⊢ (𝑔 = 𝑛 → (𝑔‘𝑎) = (𝑛‘𝑎))
5	4	cbvmptv 5212	. . . . . . . . 9 ⊢ (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)) = (𝑛 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑛‘𝑎))
6	3, 5	fsetfocdm 8897	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}–onto→𝐵)
7		focdmex 7978	. . . . . . . 8 ⊢ ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → ((𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}–onto→𝐵 → 𝐵 ∈ V))
8	6, 7	syl5com 32	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → 𝐵 ∈ V))
9	8	nelcon3d 3069	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))
10	9	expcom 419	. . . . 5 ⊢ (𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
11	10	exlimiv 1964	. . . 4 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
12	1, 11	sylbi 220	. . 3 ⊢ (𝐴 ≠ ∅ → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
13	12	impcom 413	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))
14	13	imp 412	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1811   ∈ wcel 2146  {cab 2741   ≠ wne 2959   ∉ wnel 3065  Vcvv 3454  ∅c0 4281   ↦ cmpt 5189  ⟶wf 6543  –onto→wfo 6545  ‘cfv 6547

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

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 2101  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 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555

This theorem is used by:  fsetcdmex  8899  fsetexb  8900