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

Theorem fnfi 7150
Description: A version of fnex 5757 for finite sets that does not require Replacement. (Contributed by Mario Carneiro, 16-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
fnfi  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  F  e.  Fin )

Proof of Theorem fnfi
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnresdm 5369 . . 3  |-  ( F  Fn  A  ->  ( F  |`  A )  =  F )
21adantr 451 . 2  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  A )  =  F )
3 reseq2 4966 . . . . . 6  |-  ( x  =  (/)  ->  ( F  |`  x )  =  ( F  |`  (/) ) )
43eleq1d 2362 . . . . 5  |-  ( x  =  (/)  ->  ( ( F  |`  x )  e.  Fin  <->  ( F  |`  (/) )  e.  Fin )
)
54imbi2d 307 . . . 4  |-  ( x  =  (/)  ->  ( ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  x )  e.  Fin ) 
<->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  (/) )  e.  Fin )
) )
6 reseq2 4966 . . . . . 6  |-  ( x  =  y  ->  ( F  |`  x )  =  ( F  |`  y
) )
76eleq1d 2362 . . . . 5  |-  ( x  =  y  ->  (
( F  |`  x
)  e.  Fin  <->  ( F  |`  y )  e.  Fin ) )
87imbi2d 307 . . . 4  |-  ( x  =  y  ->  (
( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  x )  e.  Fin ) 
<->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  y )  e.  Fin ) ) )
9 reseq2 4966 . . . . . 6  |-  ( x  =  ( y  u. 
{ z } )  ->  ( F  |`  x )  =  ( F  |`  ( y  u.  { z } ) ) )
109eleq1d 2362 . . . . 5  |-  ( x  =  ( y  u. 
{ z } )  ->  ( ( F  |`  x )  e.  Fin  <->  ( F  |`  ( y  u. 
{ z } ) )  e.  Fin )
)
1110imbi2d 307 . . . 4  |-  ( x  =  ( y  u. 
{ z } )  ->  ( ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  x
)  e.  Fin )  <->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  ( y  u.  {
z } ) )  e.  Fin ) ) )
12 reseq2 4966 . . . . . 6  |-  ( x  =  A  ->  ( F  |`  x )  =  ( F  |`  A ) )
1312eleq1d 2362 . . . . 5  |-  ( x  =  A  ->  (
( F  |`  x
)  e.  Fin  <->  ( F  |`  A )  e.  Fin ) )
1413imbi2d 307 . . . 4  |-  ( x  =  A  ->  (
( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  x )  e.  Fin ) 
<->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  A )  e.  Fin ) ) )
15 res0 4975 . . . . . 6  |-  ( F  |`  (/) )  =  (/)
16 0fin 7103 . . . . . 6  |-  (/)  e.  Fin
1715, 16eqeltri 2366 . . . . 5  |-  ( F  |`  (/) )  e.  Fin
1817a1i 10 . . . 4  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  (/) )  e. 
Fin )
19 resundi 4985 . . . . . . . 8  |-  ( F  |`  ( y  u.  {
z } ) )  =  ( ( F  |`  y )  u.  ( F  |`  { z } ) )
20 snfi 6957 . . . . . . . . . 10  |-  { <. z ,  ( F `  z ) >. }  e.  Fin
21 fnfun 5357 . . . . . . . . . . . 12  |-  ( F  Fn  A  ->  Fun  F )
22 funressn 5722 . . . . . . . . . . . 12  |-  ( Fun 
F  ->  ( F  |` 
{ z } ) 
C_  { <. z ,  ( F `  z ) >. } )
2321, 22syl 15 . . . . . . . . . . 11  |-  ( F  Fn  A  ->  ( F  |`  { z } )  C_  { <. z ,  ( F `  z ) >. } )
2423adantr 451 . . . . . . . . . 10  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  { z } )  C_  { <. z ,  ( F `  z ) >. } )
25 ssfi 7099 . . . . . . . . . 10  |-  ( ( { <. z ,  ( F `  z )
>. }  e.  Fin  /\  ( F  |`  { z } )  C_  { <. z ,  ( F `  z ) >. } )  ->  ( F  |`  { z } )  e.  Fin )
2620, 24, 25sylancr 644 . . . . . . . . 9  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  { z } )  e.  Fin )
27 unfi 7140 . . . . . . . . 9  |-  ( ( ( F  |`  y
)  e.  Fin  /\  ( F  |`  { z } )  e.  Fin )  ->  ( ( F  |`  y )  u.  ( F  |`  { z } ) )  e.  Fin )
2826, 27sylan2 460 . . . . . . . 8  |-  ( ( ( F  |`  y
)  e.  Fin  /\  ( F  Fn  A  /\  A  e.  Fin ) )  ->  (
( F  |`  y
)  u.  ( F  |`  { z } ) )  e.  Fin )
2919, 28syl5eqel 2380 . . . . . . 7  |-  ( ( ( F  |`  y
)  e.  Fin  /\  ( F  Fn  A  /\  A  e.  Fin ) )  ->  ( F  |`  ( y  u. 
{ z } ) )  e.  Fin )
3029expcom 424 . . . . . 6  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( ( F  |`  y )  e.  Fin  ->  ( F  |`  (
y  u.  { z } ) )  e. 
Fin ) )
3130a2i 12 . . . . 5  |-  ( ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  y )  e.  Fin )  ->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  ( y  u. 
{ z } ) )  e.  Fin )
)
3231a1i 10 . . . 4  |-  ( y  e.  Fin  ->  (
( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  y )  e.  Fin )  ->  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  ( y  u. 
{ z } ) )  e.  Fin )
) )
335, 8, 11, 14, 18, 32findcard2 7114 . . 3  |-  ( A  e.  Fin  ->  (
( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  A )  e.  Fin ) )
3433anabsi7 792 . 2  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  ( F  |`  A )  e.  Fin )
352, 34eqeltrrd 2371 1  |-  ( ( F  Fn  A  /\  A  e.  Fin )  ->  F  e.  Fin )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    = wceq 1632    e. wcel 1696    u. cun 3163    C_ wss 3165   (/)c0 3468   {csn 3653   <.cop 3656    |` cres 4707   Fun wfun 5265    Fn wfn 5266   ` cfv 5271   Fincfn 6879
This theorem is referenced by:  unirnffid  7163  mptfi  7171  seqf1olem2  11102  seqf1o  11103  iswrd  11431  wrdfin  11436  isstruct2  13173  xpsfrnel  13481  sstotbnd2  26601  prdstotbnd  26621  stoweidlem59  27911
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-int 3879  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-recs 6404  df-rdg 6439  df-1o 6495  df-oadd 6499  df-er 6676  df-en 6880  df-fin 6883
  Copyright terms: Public domain W3C validator