MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfunsn Structured version   Visualization version   GIF version

Theorem nfunsn 6225
Description: If the restriction of a class to a singleton is not a function, its value is the empty set. (Contributed by NM, 8-Aug-2010.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
nfunsn (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹𝐴) = ∅)

Proof of Theorem nfunsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eumo 2499 . . . . . . 7 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦)
2 vex 3203 . . . . . . . . . 10 𝑦 ∈ V
32brres 5402 . . . . . . . . 9 (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥𝐹𝑦𝑥 ∈ {𝐴}))
4 velsn 4193 . . . . . . . . . . 11 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5 breq1 4656 . . . . . . . . . . 11 (𝑥 = 𝐴 → (𝑥𝐹𝑦𝐴𝐹𝑦))
64, 5sylbi 207 . . . . . . . . . 10 (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦𝐴𝐹𝑦))
76biimpac 503 . . . . . . . . 9 ((𝑥𝐹𝑦𝑥 ∈ {𝐴}) → 𝐴𝐹𝑦)
83, 7sylbi 207 . . . . . . . 8 (𝑥(𝐹 ↾ {𝐴})𝑦𝐴𝐹𝑦)
98moimi 2520 . . . . . . 7 (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
101, 9syl 17 . . . . . 6 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
11 tz6.12-2 6182 . . . . . 6 (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹𝐴) = ∅)
1210, 11nsyl4 156 . . . . 5 (¬ (𝐹𝐴) = ∅ → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
1312alrimiv 1855 . . . 4 (¬ (𝐹𝐴) = ∅ → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
14 relres 5426 . . . 4 Rel (𝐹 ↾ {𝐴})
1513, 14jctil 560 . . 3 (¬ (𝐹𝐴) = ∅ → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
16 dffun6 5903 . . 3 (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
1715, 16sylibr 224 . 2 (¬ (𝐹𝐴) = ∅ → Fun (𝐹 ↾ {𝐴}))
1817con1i 144 1 (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹𝐴) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  wal 1481   = wceq 1483  wcel 1990  ∃!weu 2470  ∃*wmo 2471  c0 3915  {csn 4177   class class class wbr 4653  cres 5116  Rel wrel 5119  Fun wfun 5882  cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-res 5126  df-iota 5851  df-fun 5890  df-fv 5896
This theorem is referenced by:  fvfundmfvn0  6226  dffv2  6271
  Copyright terms: Public domain W3C validator