| 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 3065 | . . . 4 ⊢ (𝐴 ∉ V ↔ ¬ 𝐴 ∈ V) | |
| 2 | vex 3459 | . . . . . . 7 ⊢ 𝑔 ∈ V | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 ∈ V) |
| 4 | id 23 | . . . . . 6 ⊢ (𝑔 Fn 𝐴 → 𝑔 Fn 𝐴) | |
| 5 | 3, 4 | fndmexd 7902 | . . . . 5 ⊢ (𝑔 Fn 𝐴 → 𝐴 ∈ V) |
| 6 | 5 | con3i 155 | . . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝑔 Fn 𝐴) |
| 7 | 1, 6 | sylbi 220 | . . 3 ⊢ (𝐴 ∉ V → ¬ 𝑔 Fn 𝐴) |
| 8 | 7 | alrimiv 1957 | . 2 ⊢ (𝐴 ∉ V → ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 9 | fneq1 6628 | . . 3 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝐴 ↔ 𝑔 Fn 𝐴)) | |
| 10 | 9 | ab0w 4336 | . 2 ⊢ ({𝑓 ∣ 𝑓 Fn 𝐴} = ∅ ↔ ∀𝑔 ¬ 𝑔 Fn 𝐴) |
| 11 | 8, 10 | sylibr 237 | 1 ⊢ (𝐴 ∉ V → {𝑓 ∣ 𝑓 Fn 𝐴} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1568 = wceq 1570 ∈ wcel 2143 {cab 2741 ∉ wnel 3064 Vcvv 3455 ∅c0 4287 Fn wfn 6533 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-nel 3065 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-fun 6540 df-fn 6541 |
| This theorem is referenced by: fsetexb 8862 |
| Copyright terms: Public domain | W3C validator |