| 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 3071 | . . . 4 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | vex 3467 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 ∈ V) |
| 4 | id 23 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 Fn 𝐴) | |
| 5 | 3, 4 | fndmexd 7897 | . . . . 5 ⊢ (𝑔 Fn 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 155 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝑔 Fn 𝐴) |
| 7 | 1, 6 | sylbi 220 | . . 3 ⊢ (𝐴 ∉ V → ¬ 𝑔 Fn 𝐴) |
| 8 | 7 | alrimiv 1954 | . 2 ⊢ (𝐴 ∉ V → ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 9 | fneq1 6624 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝐴 ↔ 𝑔 Fn 𝐴)) | |
| 10 | 9 | ab0w 4341 | . 2 ⊢ ({𝑓 ∣ 𝑓 Fn 𝐴} = ∅ ↔ ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 11 | 8, 10 | sylibr 237 | 1 ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1565 = wceq 1567 ∈ wcel 2149 {cab 2747 ∉ wnel 3070 Vcvv 3463 ∅c0 4294 Fn wfn 6528 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-nel 3071 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-fun 6535 df-fn 6536 |
| This theorem is referenced by: fsetexb 8857 |
| Copyright terms: Public domain | W3C validator |