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

Theorem fidomdm 7581
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 5284 . 2  |-  dom  ( F  |`  _V )  =  dom  F
2 finresfin 7526 . . . 4  |-  ( F  e.  Fin  ->  ( F  |`  _V )  e. 
Fin )
3 fvex 5689 . . . . . . 7  |-  ( 1st `  x )  e.  _V
4 eqid 2433 . . . . . . 7  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) )  =  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x
) )
53, 4fnmpti 5527 . . . . . 6  |-  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) )  Fn  ( F  |`  _V )
6 dffn4 5614 . . . . . 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 5126 . . . . . 6  |-  Rel  ( F  |`  _V )
9 reldm 6614 . . . . . 6  |-  ( Rel  ( F  |`  _V )  ->  dom  ( F  |`  _V )  =  ran  ( x  e.  ( F  |`  _V )  |->  ( 1st `  x ) ) )
10 foeq3 5606 . . . . . 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 7578 . . . 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 655 . . 3  |-  ( F  e.  Fin  ->  dom  ( F  |`  _V )  ~<_  ( F  |`  _V )
)
15 resss 5122 . . . 4  |-  ( F  |`  _V )  C_  F
16 ssdomg 7343 . . . 4  |-  ( F  e.  Fin  ->  (
( F  |`  _V )  C_  F  ->  ( F  |` 
_V )  ~<_  F ) )
1715, 16mpi 17 . . 3  |-  ( F  e.  Fin  ->  ( F  |`  _V )  ~<_  F )
18 domtr 7350 . . 3  |-  ( ( dom  ( F  |`  _V )  ~<_  ( F  |` 
_V )  /\  ( F  |`  _V )  ~<_  F )  ->  dom  ( F  |`  _V )  ~<_  F )
1914, 17, 18syl2anc 654 . 2  |-  ( F  e.  Fin  ->  dom  ( F  |`  _V )  ~<_  F )
201, 19syl5eqbrr 4314 1  |-  ( F  e.  Fin  ->  dom  F  ~<_  F )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    = wceq 1362    e. wcel 1755   _Vcvv 2962    C_ wss 3316   class class class wbr 4280    e. cmpt 4338   dom cdm 4827   ran crn 4828    |` cres 4829   Rel wrel 4832    Fn wfn 5401   -onto->wfo 5404   ` cfv 5406   1stc1st 6564    ~<_ cdom 7296   Fincfn 7298
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1594  ax-4 1605  ax-5 1669  ax-6 1707  ax-7 1727  ax-8 1757  ax-9 1759  ax-10 1774  ax-11 1779  ax-12 1791  ax-13 1942  ax-ext 2414  ax-sep 4401  ax-nul 4409  ax-pow 4458  ax-pr 4519  ax-un 6361
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 959  df-3an 960  df-tru 1365  df-ex 1590  df-nf 1593  df-sb 1700  df-eu 2258  df-mo 2259  df-clab 2420  df-cleq 2426  df-clel 2429  df-nfc 2558  df-ne 2598  df-ral 2710  df-rex 2711  df-reu 2712  df-rab 2714  df-v 2964  df-sbc 3176  df-dif 3319  df-un 3321  df-in 3323  df-ss 3330  df-pss 3332  df-nul 3626  df-if 3780  df-pw 3850  df-sn 3866  df-pr 3868  df-tp 3870  df-op 3872  df-uni 4080  df-br 4281  df-opab 4339  df-mpt 4340  df-tr 4374  df-eprel 4619  df-id 4623  df-po 4628  df-so 4629  df-fr 4666  df-we 4668  df-ord 4709  df-on 4710  df-lim 4711  df-suc 4712  df-xp 4833  df-rel 4834  df-cnv 4835  df-co 4836  df-dm 4837  df-rn 4838  df-res 4839  df-ima 4840  df-iota 5369  df-fun 5408  df-fn 5409  df-f 5410  df-f1 5411  df-fo 5412  df-f1o 5413  df-fv 5414  df-om 6466  df-1st 6566  df-2nd 6567  df-1o 6908  df-er 7089  df-en 7299  df-dom 7300  df-fin 7302
This theorem is referenced by:  dmfi  7582  hashfun  12182
  Copyright terms: Public domain W3C validator