Theorem fnimaeq0 5505

Description: Images under a function never map nonempty sets to empty sets. (Contributed by Stefan O'Rear, 21-Jan-2015.)

Assertion

Ref	Expression
fnimaeq0	|- ( ( F Fn A /\ B C_ A ) -> ( ( F " B ) = (/) <-> B = (/) ) )

Proof of Theorem fnimaeq0

Step	Hyp	Ref	Expression
1		imadisj 5149	. 2 |- ( ( F " B ) = (/) <-> ( dom F i^i B ) = (/) )
2		incom 3421	. . . 4 |- ( dom F i^i B ) = ( B i^i dom F )
3		fndm 5480	. . . . . . 7 |- ( F Fn A -> dom F = A )
4	3	sseq2d 3278	. . . . . 6 |- ( F Fn A -> ( B C_ dom F <-> B C_ A ) )
5	4	biimpar 297	. . . . 5 |- ( ( F Fn A /\ B C_ A ) -> B C_ dom F )
6		df-ss 3233	. . . . 5 |- ( B C_ dom F <-> ( B i^i dom F ) = B )
7	5, 6	sylib 122	. . . 4 |- ( ( F Fn A /\ B C_ A ) -> ( B i^i dom F ) = B )
8	2, 7	eqtrid 2283	. . 3 |- ( ( F Fn A /\ B C_ A ) -> ( dom F i^i B ) = B )
9	8	eqeq1d 2247	. 2 |- ( ( F Fn A /\ B C_ A ) -> ( ( dom F i^i B ) = (/) <-> B = (/) ) )
10	1, 9	bitrid 192	1 |- ( ( F Fn A /\ B C_ A ) -> ( ( F " B ) = (/) <-> B = (/) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   i^i cin 3219   C_ wss 3220   (/)c0 3520   dom cdm 4774   "cima 4777   Fn wfn 5372

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-cnv 4782  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-fn 5380

This theorem is used by: (None)