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

Theorem nfunsn 6900
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.)
Assertion
Ref Expression
nfunsn (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹𝐴) = ∅)

Proof of Theorem nfunsn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eumo 2571 . . . . . . 7 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦)
2 vex 3451 . . . . . . . . . 10 𝑦 ∈ V
32brresi 5959 . . . . . . . . 9 (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦))
4 velsn 4605 . . . . . . . . . . 11 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5 breq1 5110 . . . . . . . . . . 11 (𝑥 = 𝐴 → (𝑥𝐹𝑦𝐴𝐹𝑦))
64, 5sylbi 217 . . . . . . . . . 10 (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦𝐴𝐹𝑦))
76biimpa 476 . . . . . . . . 9 ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) → 𝐴𝐹𝑦)
83, 7sylbi 217 . . . . . . . 8 (𝑥(𝐹 ↾ {𝐴})𝑦𝐴𝐹𝑦)
98moimi 2538 . . . . . . 7 (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
101, 9syl 17 . . . . . 6 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
11 tz6.12-2 6846 . . . . . 6 (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹𝐴) = ∅)
1210, 11nsyl4 158 . . . . 5 (¬ (𝐹𝐴) = ∅ → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
1312alrimiv 1927 . . . 4 (¬ (𝐹𝐴) = ∅ → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
14 relres 5976 . . . 4 Rel (𝐹 ↾ {𝐴})
1513, 14jctil 519 . . 3 (¬ (𝐹𝐴) = ∅ → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
16 dffun6 6524 . . 3 (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
1715, 16sylibr 234 . 2 (¬ (𝐹𝐴) = ∅ → Fun (𝐹 ↾ {𝐴}))
1817con1i 147 1 (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹𝐴) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1538   = wceq 1540  wcel 2109  ∃*wmo 2531  ∃!weu 2561  c0 4296  {csn 4589   class class class wbr 5107  cres 5640  Rel wrel 5643  Fun wfun 6505  cfv 6511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-res 5650  df-iota 6464  df-fun 6513  df-fv 6519
This theorem is referenced by:  fvfundmfvn0  6901  dffv2  6956  afv2ndeffv0  47261
  Copyright terms: Public domain W3C validator