| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfunsn | Structured version Visualization version GIF version | ||
| Description: If the restriction of a class to a singleton is not a function, then its value is the empty set. (An artifact of our function value definition.) (Contributed by NM, 8-Aug-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| nfunsn | ⊢ (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹‘𝐴) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eumo 2605 | . . . . . . 7 ⊢ (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦) | |
| 2 | vex 3458 | . . . . . . . . . 10 ⊢ 𝑦 ∈ V | |
| 3 | 2 | brresi 5974 | . . . . . . . . 9 ⊢ (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦)) |
| 4 | velsn 4598 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 5 | breq1 5103 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦)) | |
| 6 | 4, 5 | sylbi 219 | . . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦)) |
| 7 | 6 | biimpa 480 | . . . . . . . . 9 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) → 𝐴𝐹𝑦) |
| 8 | 3, 7 | sylbi 219 | . . . . . . . 8 ⊢ (𝑥(𝐹 ↾ {𝐴})𝑦 → 𝐴𝐹𝑦) |
| 9 | 8 | moimi 2572 | . . . . . . 7 ⊢ (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦) |
| 10 | 1, 9 | syl 17 | . . . . . 6 ⊢ (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦) |
| 11 | tz6.12-2 6854 | . . . . . 6 ⊢ (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹‘𝐴) = ∅) | |
| 12 | 10, 11 | nsyl4 158 | . . . . 5 ⊢ (¬ (𝐹‘𝐴) = ∅ → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦) |
| 13 | 12 | alrimiv 1947 | . . . 4 ⊢ (¬ (𝐹‘𝐴) = ∅ → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦) |
| 14 | relres 5991 | . . . 4 ⊢ Rel (𝐹 ↾ {𝐴}) | |
| 15 | 13, 14 | jctil 527 | . . 3 ⊢ (¬ (𝐹‘𝐴) = ∅ → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)) |
| 16 | dffun6 6532 | . . 3 ⊢ (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)) | |
| 17 | 15, 16 | sylibr 236 | . 2 ⊢ (¬ (𝐹‘𝐴) = ∅ → Fun (𝐹 ↾ {𝐴})) |
| 18 | 17 | con1i 147 | 1 ⊢ (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹‘𝐴) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1558 = wceq 1560 ∈ wcel 2142 ∃*wmo 2564 ∃!weu 2595 ∅c0 4285 {csn 4582 class class class wbr 5100 ↾ cres 5649 Rel wrel 5652 Fun wfun 6515 ‘cfv 6521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-res 5659 df-iota 6477 df-fun 6523 df-fv 6529 |
| This theorem is referenced by: fvfundmfvn0 6907 dffv2 6962 afv2ndeffv0 47854 |
| Copyright terms: Public domain | W3C validator |