Theorem nfunsn 5727

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.

Step	Hyp	Ref	Expression
1		eumo 2118	. . . . . . 7 ⊢ (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝐴𝐹𝑦)
2		vex 2824	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
3	2	brres 5064	. . . . . . . . 9 ⊢ (𝑥(𝐹 ↾ {𝐴})𝑦 ↔ (𝑥𝐹𝑦 ∧ 𝑥 ∈ {𝐴}))
4		velsn 3722	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5		breq1 4128	. . . . . . . . . . 11 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
6	4, 5	sylbi 121	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴} → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
7	6	biimpac 298	. . . . . . . . 9 ⊢ ((𝑥𝐹𝑦 ∧ 𝑥 ∈ {𝐴}) → 𝐴𝐹𝑦)
8	3, 7	sylbi 121	. . . . . . . 8 ⊢ (𝑥(𝐹 ↾ {𝐴})𝑦 → 𝐴𝐹𝑦)
9	8	moimi 2152	. . . . . . 7 ⊢ (∃*𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
10	1, 9	syl 14	. . . . . 6 ⊢ (∃!𝑦 𝐴𝐹𝑦 → ∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
11	10	alrimiv 1927	. . . . 5 ⊢ (∃!𝑦 𝐴𝐹𝑦 → ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦)
12		relres 5086	. . . . 5 ⊢ Rel (𝐹 ↾ {𝐴})
13	11, 12	jctil 312	. . . 4 ⊢ (∃!𝑦 𝐴𝐹𝑦 → (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
14		dffun6 5386	. . . 4 ⊢ (Fun (𝐹 ↾ {𝐴}) ↔ (Rel (𝐹 ↾ {𝐴}) ∧ ∀𝑥∃*𝑦 𝑥(𝐹 ↾ {𝐴})𝑦))
15	13, 14	sylibr 134	. . 3 ⊢ (∃!𝑦 𝐴𝐹𝑦 → Fun (𝐹 ↾ {𝐴}))
16	15	con3i 641	. 2 ⊢ (¬ Fun (𝐹 ↾ {𝐴}) → ¬ ∃!𝑦 𝐴𝐹𝑦)
17		tz6.12-2 5681	. 2 ⊢ (¬ ∃!𝑦 𝐴𝐹𝑦 → (𝐹‘𝐴) = ∅)
18	16, 17	syl 14	1 ⊢ (¬ Fun (𝐹 ↾ {𝐴}) → (𝐹‘𝐴) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   = wceq 1402  ∃!weu 2086  ∃*wmo 2087   ∈ wcel 2209  ∅c0 3520  {csn 3705   class class class wbr 4125   ↾ cres 4771  Rel wrel 4774  Fun wfun 5366  ‘cfv 5372

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-res 4781  df-iota 5332  df-fun 5374  df-fv 5380

This theorem is referenced by: (None)