| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsetprcnex | Structured version Visualization version GIF version | ||
| 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 8792 for 𝐴 ∉ V, fset0 8791 for 𝐴 = ∅, and fsetex 8793 for 𝐵 ∈ V, see also fsetexb 8801. (Contributed by AV, 14-Sep-2024.) (Proof shortened by BJ, 15-Sep-2024.) |
| Ref | Expression |
|---|---|
| fsetprcnex | ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4305 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑎 𝑎 ∈ 𝐴) | |
| 2 | feq1 6640 | . . . . . . . . . 10 ⊢ (𝑓 = 𝑚 → (𝑓:𝐴⟶𝐵 ↔ 𝑚:𝐴⟶𝐵)) | |
| 3 | 2 | cbvabv 2806 | . . . . . . . . 9 ⊢ {𝑓 ∣ 𝑓:𝐴⟶𝐵} = {𝑚 ∣ 𝑚:𝐴⟶𝐵} |
| 4 | fveq1 6833 | . . . . . . . . . 10 ⊢ (𝑔 = 𝑛 → (𝑔‘𝑎) = (𝑛‘𝑎)) | |
| 5 | 4 | cbvmptv 5202 | . . . . . . . . 9 ⊢ (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)) = (𝑛 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑛‘𝑎)) |
| 6 | 3, 5 | fsetfocdm 8798 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}–onto→𝐵) |
| 7 | focdmex 7900 | . . . . . . . 8 ⊢ ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → ((𝑔 ∈ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ↦ (𝑔‘𝑎)):{𝑓 ∣ 𝑓:𝐴⟶𝐵}–onto→𝐵 → 𝐵 ∈ V)) | |
| 8 | 6, 7 | syl5com 31 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → ({𝑓 ∣ 𝑓:𝐴⟶𝐵} ∈ V → 𝐵 ∈ V)) |
| 9 | 8 | nelcon3d 3040 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)) |
| 10 | 9 | expcom 413 | . . . . 5 ⊢ (𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))) |
| 11 | 10 | exlimiv 1931 | . . . 4 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))) |
| 12 | 1, 11 | sylbi 217 | . . 3 ⊢ (𝐴 ≠ ∅ → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V))) |
| 13 | 12 | impcom 407 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → (𝐵 ∉ V → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)) |
| 14 | 13 | imp 406 | 1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∃wex 1780 ∈ wcel 2113 {cab 2714 ≠ wne 2932 ∉ wnel 3036 Vcvv 3440 ∅c0 4285 ↦ cmpt 5179 ⟶wf 6488 –onto→wfo 6490 ‘cfv 6492 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 |
| This theorem is referenced by: fsetcdmex 8800 fsetexb 8801 |
| Copyright terms: Public domain | W3C validator |