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

Theorem fidomdm 7798
Description: Any finite set dominates its domain. (Contributed by Mario Carneiro, 22-Sep-2013.) (Revised by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
fidomdm  |-  ( F  e.  Fin  ->  dom  F  ~<_  F )

Proof of Theorem fidomdm
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 dmresv 5463 . 2  |-  dom  ( F  |`  _V )  =  dom  F
2 finresfin 7742 . . . 4  |-  ( F  e.  Fin  ->  ( F  |`  _V )  e. 
Fin )
3 fvex 5874 . . . . . . 7  |-  ( 1st `  x )  e.  _V
4 eqid 2467 . . . . . . 7  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) )  =  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) )
53, 4fnmpti 5707 . . . . . 6  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) )  Fn  ( F  |`  _V )
6 dffn4 5799 . . . . . 6  |-  ( ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) )  Fn  ( F  |`  _V )  <->  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) ) )
75, 6mpbi 208 . . . . 5  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) )
8 relres 5299 . . . . . 6  |-  Rel  ( F  |`  _V )
9 reldm 6832 . . . . . 6  |-  ( Rel  ( F  |`  _V )  ->  dom  ( F  |`  _V )  =  ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) )
10 foeq3 5791 . . . . . 6  |-  ( dom  ( F  |`  _V )  =  ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) )  ->  (
( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) ) : ( F  |`  _V ) -onto-> dom  ( F  |`  _V )  <->  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) ) ) )
118, 9, 10mp2b 10 . . . . 5  |-  ( ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> dom  ( F  |`  _V )  <->  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) ) )
127, 11mpbir 209 . . . 4  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> dom  ( F  |`  _V )
13 fodomfi 7795 . . . 4  |-  ( ( ( F  |`  _V )  e.  Fin  /\  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) : ( F  |`  _V ) -onto-> dom  ( F  |`  _V )
)  ->  dom  ( F  |`  _V )  ~<_  ( F  |`  _V ) )
142, 12, 13sylancl 662 . . 3  |-  ( F  e.  Fin  ->  dom  ( F  |`  _V )  ~<_  ( F  |`  _V )
)
15 resss 5295 . . . 4  |-  ( F  |`  _V )  C_  F
16 ssdomg 7558 . . . 4  |-  ( F  e.  Fin  ->  (
( F  |`  _V )  C_  F  ->  ( F  |` 
_V )  ~<_  F ) )
1715, 16mpi 17 . . 3  |-  ( F  e.  Fin  ->  ( F  |`  _V )  ~<_  F )
18 domtr 7565 . . 3  |-  ( ( dom  ( F  |`  _V )  ~<_  ( F  |` 
_V )  /\  ( F  |`  _V )  ~<_  F )  ->  dom  ( F  |`  _V )  ~<_  F )
1914, 17, 18syl2anc 661 . 2  |-  ( F  e.  Fin  ->  dom  ( F  |`  _V )  ~<_  F )
201, 19syl5eqbrr 4481 1  |-  ( F  e.  Fin  ->  dom  F  ~<_  F )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    = wceq 1379    e. wcel 1767   _Vcvv 3113    C_ wss 3476   class class class wbr 4447    |-> cmpt 4505   dom cdm 4999   ran crn 5000    |` cres 5001   Rel wrel 5004    Fn wfn 5581   -onto->wfo 5584   ` cfv 5586   1stc1st 6779    ~<_ cdom 7511   Fincfn 7513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-reu 2821  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-pss 3492  df-nul 3786  df-if 3940  df-pw 4012  df-sn 4028  df-pr 4030  df-tp 4032  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-mpt 4507  df-tr 4541  df-eprel 4791  df-id 4795  df-po 4800  df-so 4801  df-fr 4838  df-we 4840  df-ord 4881  df-on 4882  df-lim 4883  df-suc 4884  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5549  df-fun 5588  df-fn 5589  df-f 5590  df-f1 5591  df-fo 5592  df-f1o 5593  df-fv 5594  df-om 6679  df-1st 6781  df-2nd 6782  df-1o 7127  df-er 7308  df-en 7514  df-dom 7515  df-fin 7517
This theorem is referenced by:  dmfi  7799  hashfun  12457
  Copyright terms: Public domain W3C validator