| 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 3062 | . . . 4 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | vex 3454 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 ∈ V) |
| 4 | id 23 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 Fn 𝐴) | |
| 5 | 3, 4 | fndmexd 7918 | . . . . 5 ⊢ (𝑔 Fn 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 155 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝑔 Fn 𝐴) |
| 7 | 1, 6 | sylbi 220 | . . 3 ⊢ (𝐴 ∉ V → ¬ 𝑔 Fn 𝐴) |
| 8 | 7 | alrimiv 1959 | . 2 ⊢ (𝐴 ∉ V → ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 9 | fneq1 6633 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝐴 ↔ 𝑔 Fn 𝐴)) | |
| 10 | 9 | ab0w 4327 | . 2 ⊢ ({𝑓 ∣ 𝑓 Fn 𝐴} = ∅ ↔ ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 11 | 8, 10 | sylibr 237 | 1 ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∀wal 1567 = wceq 1569 ∈ wcel 2144 {cab 2738 ∉ wnel 3061 Vcvv 3450 ∅c0 4277 Fn wfn 6536 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7753 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-nel 3062 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-fun 6543 df-fn 6544 |
| This theorem is used by: fsetexb 8891 |
| Copyright terms: Public domain | W3C validator |