MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsetprcnex Structured version   Visualization version   GIF version

Theorem fsetprcnex 8922
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 8915 for 𝐴 ∉ V, fset0 8914 for 𝐴 = ∅, and fsetex 8916 for 𝐵 ∈ V, see also fsetexb 8924. (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.
StepHypRef Expression
1 n0 4303 . . . 4 (𝐴 ≠ ∅ ↔ ∃𝑎 𝑎 ∈ 𝐴)
2 feq1 6717 . . . . . . . . . 10 (𝑓 = 𝑚 → (𝑓:𝐴⟶𝐵 ↔ 𝑚:𝐴⟶𝐵))
32cbvabv 2834 . . . . . . . . 9 {𝑓 ∣ 𝑓:𝐴⟶𝐵} = {𝑚 ∣ 𝑚:𝐴⟶𝐵}
4 fveq1 6915 . . . . . . . . . 10 (𝑔 = 𝑛 → (𝑔‘𝑎) = (𝑛‘𝑎))
54cbvmptv 5215 . . . . . . . . 9 (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)) = (𝑛 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑛‘𝑎))
63, 5fsetfocdm 8921 . . . . . . . 8 ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}⟶onto𝐵)
7 focdmex 8002 . . . . . . . 8 ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → ((𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}⟶onto𝐵 → 𝐵 ∈ V))
86, 7syl5com 32 . . . . . . 7 ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → 𝐵 ∈ V))
98nelcon3d 3069 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))
109expcom 419 . . . . 5 (𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
1110exlimiv 1965 . . . 4 (∃𝑎 𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
121, 11sylbi 220 . . 3 (𝐴 ≠ ∅ → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)))
1312impcom 413 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))
1413imp 412 1 (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959   ∉ wnel 3065  Vcvv 3454  ∅c0 4281   ↦ cmpt 5192  ⟶wf 6562  ⟶ontowfo 6564  ‘cfv 6566
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 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574
This theorem is used by:  fsetcdmex  8923  fsetexb  8924
  Copyright terms: Public domain W3C validator