Theorem suppimacnvfn 6424

Description: Support sets of functions expressed by inverse images. (Contributed by AV, 31-Mar-2019.) (Revised by AV, 7-Apr-2019.)

Assertion

Ref	Expression
suppimacnvfn	|- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( F supp Z ) = ( `' F " ( _V \ { Z } ) ) )

Proof of Theorem suppimacnvfn

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp2 1025	. . . . . . . . 9 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> F e. V )
2		vex 2806	. . . . . . . . 9 |- x e. _V
3		fvexg 5667	. . . . . . . . 9 |- ( ( F e. V /\ x e. _V ) -> ( F ` x ) e. _V )
4	1, 2, 3	sylancl 413	. . . . . . . 8 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( F ` x ) e. _V )
5		elsng 3688	. . . . . . . 8 |- ( ( F ` x ) e. _V -> ( ( F ` x ) e. { Z } <-> ( F ` x ) = Z ) )
6	4, 5	syl 14	. . . . . . 7 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( ( F ` x ) e. { Z } <-> ( F ` x ) = Z ) )
7	6	necon3bbid 2443	. . . . . 6 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( -. ( F ` x ) e. { Z } <-> ( F ` x ) =/= Z ) )
8	4	biantrurd 305	. . . . . 6 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( -. ( F ` x ) e. { Z } <-> ( ( F ` x ) e. _V /\ -. ( F ` x ) e. { Z } ) ) )
9	7, 8	bitr3d 190	. . . . 5 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( ( F ` x ) =/= Z <-> ( ( F ` x ) e. _V /\ -. ( F ` x ) e. { Z } ) ) )
10		eldif 3210	. . . . 5 |- ( ( F ` x ) e. ( _V \ { Z } ) <-> ( ( F ` x ) e. _V /\ -. ( F ` x ) e. { Z } ) )
11	9, 10	bitr4di 198	. . . 4 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( ( F ` x ) =/= Z <-> ( F ` x ) e. ( _V \ { Z } ) ) )
12	11	anbi2d 464	. . 3 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( ( x e. X /\ ( F ` x ) =/= Z ) <-> ( x e. X /\ ( F ` x ) e. ( _V \ { Z } ) ) ) )
13		elsuppfng 6420	. . 3 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( x e. ( F supp Z ) <-> ( x e. X /\ ( F ` x ) =/= Z ) ) )
14		elpreima 5775	. . . 4 |- ( F Fn X -> ( x e. ( `' F " ( _V \ { Z } ) ) <-> ( x e. X /\ ( F ` x ) e. ( _V \ { Z } ) ) ) )
15	14	3ad2ant1 1045	. . 3 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( x e. ( `' F " ( _V \ { Z } ) ) <-> ( x e. X /\ ( F ` x ) e. ( _V \ { Z } ) ) ) )
16	12, 13, 15	3bitr4d 220	. 2 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( x e. ( F supp Z ) <-> x e. ( `' F " ( _V \ { Z } ) ) ) )
17	16	eqrdv 2229	1 |- ( ( F Fn X /\ F e. V /\ Z e. W ) -> ( F supp Z ) = ( `' F " ( _V \ { Z } ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   = wceq 1398   e. wcel 2202   =/= wne 2403   _Vcvv 2803   \ cdif 3198   {csn 3673   `'ccnv 4730   "cima 4734   Fn wfn 5328   ` cfv 5333  (class class class)co 6028   supp csupp 6413

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-supp 6414

This theorem is referenced by:  fsuppeq  6425  fsuppeqg  6426  mptsuppdifd  6433  suppcofn  6444