| 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 3037 | . . . 4 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | vex 3444 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 ∈ V) |
| 4 | id 22 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 Fn 𝐴) | |
| 5 | 3, 4 | fndmexd 7846 | . . . . 5 ⊢ (𝑔 Fn 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 154 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝑔 Fn 𝐴) |
| 7 | 1, 6 | sylbi 217 | . . 3 ⊢ (𝐴 ∉ V → ¬ 𝑔 Fn 𝐴) |
| 8 | 7 | alrimiv 1928 | . 2 ⊢ (𝐴 ∉ V → ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 9 | fneq1 6583 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝐴 ↔ 𝑔 Fn 𝐴)) | |
| 10 | 9 | ab0w 4331 | . 2 ⊢ ({𝑓 ∣ 𝑓 Fn 𝐴} = ∅ ↔ ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 11 | 8, 10 | sylibr 234 | 1 ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1539 = wceq 1541 ∈ wcel 2113 {cab 2714 ∉ wnel 3036 Vcvv 3440 ∅c0 4285 Fn wfn 6487 |
| 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-ext 2708 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-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-nel 3037 df-rab 3400 df-v 3442 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-br 5099 df-opab 5161 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-fun 6494 df-fn 6495 |
| This theorem is referenced by: fsetexb 8801 |
| Copyright terms: Public domain | W3C validator |