Theorem fn0 5317

Description: A function with empty domain is empty. (Contributed by NM, 15-Apr-1998.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fn0	|- ( F Fn (/) <-> F = (/) )

Proof of Theorem fn0

Step	Hyp	Ref	Expression
1		fnrel 5296	. . 3 |- ( F Fn (/) -> Rel F )
2		fndm 5297	. . 3 |- ( F Fn (/) -> dom F = (/) )
3		reldm0 4829	. . . 4 |- ( Rel F -> ( F = (/) <-> dom F = (/) ) )
4	3	biimpar 295	. . 3 |- ( ( Rel F /\ dom F = (/) ) -> F = (/) )
5	1, 2, 4	syl2anc 409	. 2 |- ( F Fn (/) -> F = (/) )
6		fun0 5256	. . . 4 |- Fun (/)
7		dm0 4825	. . . 4 |- dom (/) = (/)
8		df-fn 5201	. . . 4 |- ( (/) Fn (/) <-> ( Fun (/) /\ dom (/) = (/) ) )
9	6, 7, 8	mpbir2an 937	. . 3 |- (/) Fn (/)
10		fneq1 5286	. . 3 |- ( F = (/) -> ( F Fn (/) <-> (/) Fn (/) ) )
11	9, 10	mpbiri 167	. 2 |- ( F = (/) -> F Fn (/) )
12	5, 11	impbii 125	1 |- ( F Fn (/) <-> F = (/) )

Syntax hints:   <-> wb 104   = wceq 1348   (/)c0 3414   dom cdm 4611   Rel wrel 4616   Fun wfun 5192   Fn wfn 5193

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-fun 5200  df-fn 5201

This theorem is referenced by:  mpt0  5325  f0  5388  f00  5389  f0bi  5390  f1o00  5477  fo00  5478  tpos0  6253  ixp0x  6704  0fz1  10001