| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsetdmprc0 | Structured version Visualization version GIF version | ||
| Description: The set of functions with a proper class as domain is empty. (Contributed by AV, 22-Aug-2024.) |
| Ref | Expression |
|---|---|
| fsetdmprc0 | ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nel 3040 | . . . 4 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | vex 3436 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 ∈ V) |
| 4 | id 22 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 Fn 𝐴) | |
| 5 | 3, 4 | fndmexd 7851 | . . . . 5 ⊢ (𝑔 Fn 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 154 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝑔 Fn 𝐴) |
| 7 | 1, 6 | sylbi 218 | . . 3 ⊢ (𝐴 ∉ V → ¬ 𝑔 Fn 𝐴) |
| 8 | 7 | alrimiv 1934 | . 2 ⊢ (𝐴 ∉ V → ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 9 | fneq1 6583 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝐴 ↔ 𝑔 Fn 𝐴)) | |
| 10 | 9 | ab0w 4314 | . 2 ⊢ ({𝑓 ∣ 𝑓 Fn 𝐴} = ∅ ↔ ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 11 | 8, 10 | sylibr 235 | 1 ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1545 = wceq 1547 ∈ wcel 2119 {cab 2718 ∉ wnel 3039 Vcvv 3432 ∅c0 4268 Fn wfn 6487 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-nel 3040 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-fun 6494 df-fn 6495 |
| This theorem is referenced by: fsetexb 8808 |
| Copyright terms: Public domain | W3C validator |