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

Theorem nfunsn 6924
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 2604 . . . . . . 7 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦)
2 vex 3455 . . . . . . . . . 10 𝑦 ∈ V
32brresi 5979 . . . . . . . . 9 (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦))
4 velsn 4600 . . . . . . . . . . 11 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5 breq1 5106 . . . . . . . . . . 11 (𝑥 = 𝐴 → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
64, 5sylbi 220 . . . . . . . . . 10 (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
76biimpa 482 . . . . . . . . 9 ((𝑥 ∈ {𝐴} ∧ 𝑥𝐹𝑦) → 𝐴𝐹𝑦)
83, 7sylbi 220 . . . . . . . 8 (𝑥(𝐹 ↾ {𝐴})𝑦 → 𝐴𝐹𝑦)
98moimi 2571 . . . . . . 7 (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
101, 9syl 18 . . . . . 6 (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
11 tz6.12-2 6872 . . . . . 6 (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹‘𝐴) = ∅)
1210, 11nsyl4 159 . . . . 5 (¬ (𝐹‘𝐴) = ∅ → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
1312alrimiv 1960 . . . 4 (¬ (𝐹‘𝐴) = ∅ → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
14 relres 5996 . . . 4 Rel (𝐹 ↾ {𝐴})
1513, 14jctil 529 . . 3 (¬ (𝐹‘𝐴) = ∅ → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
16 dffun6 6549 . . 3 (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
1715, 16sylibr 237 . 2 (¬ (𝐹‘𝐴) = ∅ → Fun (𝐹 ↾ {𝐴}))
1817con1i 148 1 (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹‘𝐴) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∃*wmo 2563  ∃!weu 2594  ∅c0 4279  {csn 4584   class class class wbr 5103   ↾ cres 5653  Rel wrel 5656  Fun wfun 6532  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-res 5663  df-iota 6494  df-fun 6540  df-fv 6546
This theorem is used by:  fvfundmfvn0  6925  dffv2  6980  afv2ndeffv0  48329
  Copyright terms: Public domain W3C validator