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

Theorem nfunsn 6881
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 2579 . . . . . . 7 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦)
2 vex 3446 . . . . . . . . . 10 𝑦 ∈ V
32brresi 5955 . . . . . . . . 9 (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦))
4 velsn 4598 . . . . . . . . . . 11 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5 breq1 5103 . . . . . . . . . . 11 (𝑥 = 𝐴 → (𝑥𝐹𝑦𝐴𝐹𝑦))
64, 5sylbi 217 . . . . . . . . . 10 (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦𝐴𝐹𝑦))
76biimpa 476 . . . . . . . . 9 ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) → 𝐴𝐹𝑦)
83, 7sylbi 217 . . . . . . . 8 (𝑥(𝐹 ↾ {𝐴})𝑦𝐴𝐹𝑦)
98moimi 2546 . . . . . . 7 (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
101, 9syl 17 . . . . . 6 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
11 tz6.12-2 6829 . . . . . 6 (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹𝐴) = ∅)
1210, 11nsyl4 158 . . . . 5 (¬ (𝐹𝐴) = ∅ → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
1312alrimiv 1929 . . . 4 (¬ (𝐹𝐴) = ∅ → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
14 relres 5972 . . . 4 Rel (𝐹 ↾ {𝐴})
1513, 14jctil 519 . . 3 (¬ (𝐹𝐴) = ∅ → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
16 dffun6 6511 . . 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 1540   = wceq 1542  wcel 2114  ∃*wmo 2538  ∃!weu 2569  c0 4287  {csn 4582   class class class wbr 5100  cres 5634  Rel wrel 5637  Fun wfun 6494  cfv 6500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-res 5644  df-iota 6456  df-fun 6502  df-fv 6508
This theorem is referenced by:  fvfundmfvn0  6882  dffv2  6937  afv2ndeffv0  47620
  Copyright terms: Public domain W3C validator