Theorem fndmdif 5667

Description: Two ways to express the locus of differences between two functions. (Contributed by Stefan O'Rear, 17-Jan-2015.)

Assertion

Ref	Expression
fndmdif	|- ( ( F Fn A /\ G Fn A ) -> dom ( F \ G ) = { x e. A | ( F ` x ) =/= ( G ` x ) } )

Distinct variable groups:   x, F   x, G   x, A

Proof of Theorem fndmdif

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		difss 3289	. . . . 5 |- ( F \ G ) C_ F
2		dmss 4865	. . . . 5 |- ( ( F \ G ) C_ F -> dom ( F \ G ) C_ dom F )
3	1, 2	ax-mp 5	. . . 4 |- dom ( F \ G ) C_ dom F
4		fndm 5357	. . . . 5 |- ( F Fn A -> dom F = A )
5	4	adantr 276	. . . 4 |- ( ( F Fn A /\ G Fn A ) -> dom F = A )
6	3, 5	sseqtrid 3233	. . 3 |- ( ( F Fn A /\ G Fn A ) -> dom ( F \ G ) C_ A )
7		dfss1 3367	. . 3 |- ( dom ( F \ G ) C_ A <-> ( A i^i dom ( F \ G ) ) = dom ( F \ G ) )
8	6, 7	sylib 122	. 2 |- ( ( F Fn A /\ G Fn A ) -> ( A i^i dom ( F \ G ) ) = dom ( F \ G ) )
9		vex 2766	. . . . 5 |- x e. _V
10	9	eldm 4863	. . . 4 |- ( x e. dom ( F \ G ) <-> E. y x ( F \ G ) y )
11		eqcom 2198	. . . . . . . 8 |- ( ( F ` x ) = ( G ` x ) <-> ( G ` x ) = ( F ` x ) )
12		fnbrfvb 5601	. . . . . . . 8 |- ( ( G Fn A /\ x e. A ) -> ( ( G ` x ) = ( F ` x ) <-> x G ( F ` x ) ) )
13	11, 12	bitrid 192	. . . . . . 7 |- ( ( G Fn A /\ x e. A ) -> ( ( F ` x ) = ( G ` x ) <-> x G ( F ` x ) ) )
14	13	adantll 476	. . . . . 6 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( ( F ` x ) = ( G ` x ) <-> x G ( F ` x ) ) )
15	14	necon3abid 2406	. . . . 5 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( ( F ` x ) =/= ( G ` x ) <-> -. x G ( F ` x ) ) )
16		funfvex 5575	. . . . . . . 8 |- ( ( Fun F /\ x e. dom F ) -> ( F ` x ) e. _V )
17	16	funfni 5358	. . . . . . 7 |- ( ( F Fn A /\ x e. A ) -> ( F ` x ) e. _V )
18	17	adantlr 477	. . . . . 6 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( F ` x ) e. _V )
19		breq2 4037	. . . . . . . 8 |- ( y = ( F ` x ) -> ( x G y <-> x G ( F ` x ) ) )
20	19	notbid 668	. . . . . . 7 |- ( y = ( F ` x ) -> ( -. x G y <-> -. x G ( F ` x ) ) )
21	20	ceqsexgv 2893	. . . . . 6 |- ( ( F ` x ) e. _V -> ( E. y ( y = ( F ` x ) /\ -. x G y ) <-> -. x G ( F ` x ) ) )
22	18, 21	syl 14	. . . . 5 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( E. y ( y = ( F ` x ) /\ -. x G y ) <-> -. x G ( F ` x ) ) )
23		eqcom 2198	. . . . . . . . . 10 |- ( y = ( F ` x ) <-> ( F ` x ) = y )
24		fnbrfvb 5601	. . . . . . . . . 10 |- ( ( F Fn A /\ x e. A ) -> ( ( F ` x ) = y <-> x F y ) )
25	23, 24	bitrid 192	. . . . . . . . 9 |- ( ( F Fn A /\ x e. A ) -> ( y = ( F ` x ) <-> x F y ) )
26	25	adantlr 477	. . . . . . . 8 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( y = ( F ` x ) <-> x F y ) )
27	26	anbi1d 465	. . . . . . 7 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( ( y = ( F ` x ) /\ -. x G y ) <-> ( x F y /\ -. x G y ) ) )
28		brdif 4086	. . . . . . 7 |- ( x ( F \ G ) y <-> ( x F y /\ -. x G y ) )
29	27, 28	bitr4di 198	. . . . . 6 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( ( y = ( F ` x ) /\ -. x G y ) <-> x ( F \ G ) y ) )
30	29	exbidv 1839	. . . . 5 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( E. y ( y = ( F ` x ) /\ -. x G y ) <-> E. y x ( F \ G ) y ) )
31	15, 22, 30	3bitr2rd 217	. . . 4 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( E. y x ( F \ G ) y <-> ( F ` x ) =/= ( G ` x ) ) )
32	10, 31	bitrid 192	. . 3 |- ( ( ( F Fn A /\ G Fn A ) /\ x e. A ) -> ( x e. dom ( F \ G ) <-> ( F ` x ) =/= ( G ` x ) ) )
33	32	rabbi2dva 3371	. 2 |- ( ( F Fn A /\ G Fn A ) -> ( A i^i dom ( F \ G ) ) = { x e. A | ( F ` x ) =/= ( G ` x ) } )
34	8, 33	eqtr3d 2231	1 |- ( ( F Fn A /\ G Fn A ) -> dom ( F \ G ) = { x e. A | ( F ` x ) =/= ( G ` x ) } )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   E.wex 1506   e. wcel 2167   =/= wne 2367   {crab 2479   _Vcvv 2763   \ cdif 3154   i^i cin 3156   C_ wss 3157   class class class wbr 4033   dom cdm 4663   Fn wfn 5253   ` cfv 5258

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fn 5261  df-fv 5266

This theorem is referenced by:  fndmdifcom  5668