| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fsetsnprcnex | Structured version Visualization version GIF version | ||
| Description: The class of all functions from a (proper) singleton into a proper class 𝐵 is not a set. (Contributed by AV, 13-Sep-2024.) |
| Ref | Expression |
|---|---|
| fsetsnprcnex | ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2729 | . . . . . . 7 ⊢ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} | |
| 2 | eqid 2729 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ {〈𝑆, 𝑥〉}) = (𝑥 ∈ 𝐵 ↦ {〈𝑆, 𝑥〉}) | |
| 3 | 1, 2 | fsetsnf1o 47048 | . . . . . 6 ⊢ (𝑆 ∈ 𝑉 → (𝑥 ∈ 𝐵 ↦ {〈𝑆, 𝑥〉}):𝐵–1-1-onto→{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}}) |
| 4 | f1ovv 7916 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ↦ {〈𝑆, 𝑥〉}):𝐵–1-1-onto→{𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∈ V)) | |
| 5 | 3, 4 | syl 17 | . . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∈ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∈ V)) |
| 6 | 5 | notbid 318 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (¬ 𝐵 ∈ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∈ V)) |
| 7 | df-nel 3030 | . . . 4 ⊢ (𝐵 ∉ V ↔ ¬ 𝐵 ∈ V) | |
| 8 | df-nel 3030 | . . . 4 ⊢ ({𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∉ V ↔ ¬ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∈ V) | |
| 9 | 6, 7, 8 | 3bitr4g 314 | . . 3 ⊢ (𝑆 ∈ 𝑉 → (𝐵 ∉ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∉ V)) |
| 10 | 9 | biimpa 476 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∉ V) |
| 11 | fsetabsnop 47044 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}}) | |
| 12 | 11 | adantr 480 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}}) |
| 13 | eqidd 2730 | . . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → V = V) | |
| 14 | 12, 13 | neleq12d 3034 | . 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → ({𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V ↔ {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {〈𝑆, 𝑏〉}} ∉ V)) |
| 15 | 10, 14 | mpbird 257 | 1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑆}⟶𝐵} ∉ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {cab 2707 ∉ wnel 3029 ∃wrex 3053 Vcvv 3444 {csn 4585 〈cop 4591 ↦ cmpt 5183 ⟶wf 6495 –1-1-onto→wf1o 6498 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 |
| This theorem is referenced by: fsetprcnexALT 47056 |
| Copyright terms: Public domain | W3C validator |