Theorem fsuppeqg 6488

Description: Version of fsuppeq 6487 avoiding ax-coll 4246 by assuming F is a set rather than its domain I. (Contributed by SN, 30-Jul-2024.)

Assertion

Ref	Expression
fsuppeqg	|- ( ( F e. V /\ Z e. W ) -> ( F : I --> S -> ( F supp Z ) = ( `' F " ( S \ { Z } ) ) ) )

Proof of Theorem fsuppeqg

Step	Hyp	Ref	Expression
1		ffn 5533	. . . . 5 |- ( F : I --> S -> F Fn I )
2	1	adantl 277	. . . 4 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> F Fn I )
3		simpll 531	. . . 4 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> F e. V )
4		simplr 533	. . . 4 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> Z e. W )
5		suppimacnvfn 6486	. . . 4 |- ( ( F Fn I /\ F e. V /\ Z e. W ) -> ( F supp Z ) = ( `' F " ( _V \ { Z } ) ) )
6	2, 3, 4, 5	syl3anc 1278	. . 3 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> ( F supp Z ) = ( `' F " ( _V \ { Z } ) ) )
7		ffun 5536	. . . . . . 7 |- ( F : I --> S -> Fun F )
8		inpreima 5834	. . . . . . 7 |- ( Fun F -> ( `' F " ( S i^i ( _V \ { Z } ) ) ) = ( ( `' F " S ) i^i ( `' F " ( _V \ { Z } ) ) ) )
9	7, 8	syl 14	. . . . . 6 |- ( F : I --> S -> ( `' F " ( S i^i ( _V \ { Z } ) ) ) = ( ( `' F " S ) i^i ( `' F " ( _V \ { Z } ) ) ) )
10		cnvimass 5150	. . . . . . . 8 |- ( `' F " ( _V \ { Z } ) ) C_ dom F
11		fdm 5539	. . . . . . . . 9 |- ( F : I --> S -> dom F = I )
12		fimacnv 5837	. . . . . . . . 9 |- ( F : I --> S -> ( `' F " S ) = I )
13	11, 12	eqtr4d 2274	. . . . . . . 8 |- ( F : I --> S -> dom F = ( `' F " S ) )
14	10, 13	sseqtrid 3298	. . . . . . 7 |- ( F : I --> S -> ( `' F " ( _V \ { Z } ) ) C_ ( `' F " S ) )
15		sseqin2 3450	. . . . . . 7 |- ( ( `' F " ( _V \ { Z } ) ) C_ ( `' F " S ) <-> ( ( `' F " S ) i^i ( `' F " ( _V \ { Z } ) ) ) = ( `' F " ( _V \ { Z } ) ) )
16	14, 15	sylib 122	. . . . . 6 |- ( F : I --> S -> ( ( `' F " S ) i^i ( `' F " ( _V \ { Z } ) ) ) = ( `' F " ( _V \ { Z } ) ) )
17	9, 16	eqtrd 2271	. . . . 5 |- ( F : I --> S -> ( `' F " ( S i^i ( _V \ { Z } ) ) ) = ( `' F " ( _V \ { Z } ) ) )
18		invdif 3473	. . . . . 6 |- ( S i^i ( _V \ { Z } ) ) = ( S \ { Z } )
19	18	imaeq2i 5124	. . . . 5 |- ( `' F " ( S i^i ( _V \ { Z } ) ) ) = ( `' F " ( S \ { Z } ) )
20	17, 19	eqtr3di 2286	. . . 4 |- ( F : I --> S -> ( `' F " ( _V \ { Z } ) ) = ( `' F " ( S \ { Z } ) ) )
21	20	adantl 277	. . 3 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> ( `' F " ( _V \ { Z } ) ) = ( `' F " ( S \ { Z } ) ) )
22	6, 21	eqtrd 2271	. 2 |- ( ( ( F e. V /\ Z e. W ) /\ F : I --> S ) -> ( F supp Z ) = ( `' F " ( S \ { Z } ) ) )
23	22	ex 115	1 |- ( ( F e. V /\ Z e. W ) -> ( F : I --> S -> ( F supp Z ) = ( `' F " ( S \ { Z } ) ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   _Vcvv 2821   \ cdif 3217   i^i cin 3219   C_ wss 3220   {csn 3709   `'ccnv 4773   dom cdm 4774   "cima 4777   Fun wfun 5371   Fn wfn 5372   -->wf 5373  (class class class)co 6085   supp csupp 6475

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  ax-un 4578  ax-setind 4684

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-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-supp 6476

This theorem is used by:  fcdmnn0suppg  9619