MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnnfpeq0 Structured version   Unicode version

Theorem fnnfpeq0 6084
Description: A function is the identity iff it moves no points. (Contributed by Stefan O'Rear, 25-Aug-2015.)
Assertion
Ref Expression
fnnfpeq0  |-  ( F  Fn  A  ->  ( dom  ( F  \  _I  )  =  (/)  <->  F  =  (  _I  |`  A ) ) )

Proof of Theorem fnnfpeq0
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 rabeq0 3790 . . 3  |-  ( { x  e.  A  | 
( F `  x
)  =/=  x }  =  (/)  <->  A. x  e.  A  -.  ( F `  x
)  =/=  x )
2 fvresi 6079 . . . . . . 7  |-  ( x  e.  A  ->  (
(  _I  |`  A ) `
 x )  =  x )
32eqeq2d 2455 . . . . . 6  |-  ( x  e.  A  ->  (
( F `  x
)  =  ( (  _I  |`  A ) `  x )  <->  ( F `  x )  =  x ) )
43adantl 466 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( ( F `  x )  =  ( (  _I  |`  A ) `
 x )  <->  ( F `  x )  =  x ) )
5 nne 2642 . . . . 5  |-  ( -.  ( F `  x
)  =/=  x  <->  ( F `  x )  =  x )
64, 5syl6rbbr 264 . . . 4  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( -.  ( F `
 x )  =/=  x  <->  ( F `  x )  =  ( (  _I  |`  A ) `
 x ) ) )
76ralbidva 2877 . . 3  |-  ( F  Fn  A  ->  ( A. x  e.  A  -.  ( F `  x
)  =/=  x  <->  A. x  e.  A  ( F `  x )  =  ( (  _I  |`  A ) `
 x ) ) )
81, 7syl5bb 257 . 2  |-  ( F  Fn  A  ->  ( { x  e.  A  |  ( F `  x )  =/=  x }  =  (/)  <->  A. x  e.  A  ( F `  x )  =  ( (  _I  |`  A ) `
 x ) ) )
9 fndifnfp 6082 . . 3  |-  ( F  Fn  A  ->  dom  ( F  \  _I  )  =  { x  e.  A  |  ( F `  x )  =/=  x } )
109eqeq1d 2443 . 2  |-  ( F  Fn  A  ->  ( dom  ( F  \  _I  )  =  (/)  <->  { x  e.  A  |  ( F `  x )  =/=  x }  =  (/) ) )
11 fnresi 5685 . . 3  |-  (  _I  |`  A )  Fn  A
12 eqfnfv 5963 . . 3  |-  ( ( F  Fn  A  /\  (  _I  |`  A )  Fn  A )  -> 
( F  =  (  _I  |`  A )  <->  A. x  e.  A  ( F `  x )  =  ( (  _I  |`  A ) `  x
) ) )
1311, 12mpan2 671 . 2  |-  ( F  Fn  A  ->  ( F  =  (  _I  |`  A )  <->  A. x  e.  A  ( F `  x )  =  ( (  _I  |`  A ) `
 x ) ) )
148, 10, 133bitr4d 285 1  |-  ( F  Fn  A  ->  ( dom  ( F  \  _I  )  =  (/)  <->  F  =  (  _I  |`  A ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1381    e. wcel 1802    =/= wne 2636   A.wral 2791   {crab 2795    \ cdif 3456   (/)c0 3768    _I cid 4777   dom cdm 4986    |` cres 4988    Fn wfn 5570   ` cfv 5575
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1603  ax-4 1616  ax-5 1689  ax-6 1732  ax-7 1774  ax-8 1804  ax-9 1806  ax-10 1821  ax-11 1826  ax-12 1838  ax-13 1983  ax-ext 2419  ax-sep 4555  ax-nul 4563  ax-pow 4612  ax-pr 4673
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 974  df-tru 1384  df-ex 1598  df-nf 1602  df-sb 1725  df-eu 2270  df-mo 2271  df-clab 2427  df-cleq 2433  df-clel 2436  df-nfc 2591  df-ne 2638  df-ral 2796  df-rex 2797  df-rab 2800  df-v 3095  df-sbc 3312  df-csb 3419  df-dif 3462  df-un 3464  df-in 3466  df-ss 3473  df-nul 3769  df-if 3924  df-sn 4012  df-pr 4014  df-op 4018  df-uni 4232  df-br 4435  df-opab 4493  df-mpt 4494  df-id 4782  df-xp 4992  df-rel 4993  df-cnv 4994  df-co 4995  df-dm 4996  df-rn 4997  df-res 4998  df-ima 4999  df-iota 5538  df-fun 5577  df-fn 5578  df-f 5579  df-fv 5583
This theorem is referenced by:  symggen  16366  m1detdiag  18969  mdetdiaglem  18970
  Copyright terms: Public domain W3C validator