ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1dmvrnfibi Unicode version

Theorem f1dmvrnfibi 7262
Description: A one-to-one function whose domain is a set is finite if and only if its range is finite. See also f1vrnfibi 7263. (Contributed by AV, 10-Jan-2020.)
Assertion
Ref Expression
f1dmvrnfibi  |-  ( ( A  e.  V  /\  F : A -1-1-> B )  ->  ( F  e. 
Fin 
<->  ran  F  e.  Fin ) )

Proof of Theorem f1dmvrnfibi
StepHypRef Expression
1 f1rel 5605 . . . 4  |-  ( F : A -1-1-> B  ->  Rel  F )
21ad2antlr 493 . . 3  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  F  e.  Fin )  ->  Rel  F
)
3 f1cnv 5666 . . . . 5  |-  ( F : A -1-1-> B  ->  `' F : ran  F -1-1-onto-> A
)
4 f1ofun 5644 . . . . 5  |-  ( `' F : ran  F -1-1-onto-> A  ->  Fun  `' F )
53, 4syl 14 . . . 4  |-  ( F : A -1-1-> B  ->  Fun  `' F )
65ad2antlr 493 . . 3  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  F  e.  Fin )  ->  Fun  `' F )
7 simpr 110 . . 3  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  F  e.  Fin )  ->  F  e. 
Fin )
8 funrnfi 7260 . . 3  |-  ( ( Rel  F  /\  Fun  `' F  /\  F  e. 
Fin )  ->  ran  F  e.  Fin )
92, 6, 7, 8syl3anc 1278 . 2  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  F  e.  Fin )  ->  ran  F  e.  Fin )
10 simpr 110 . . . 4  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  ran  F  e.  Fin )
11 f1dm 5606 . . . . . . . 8  |-  ( F : A -1-1-> B  ->  dom  F  =  A )
12 f1f1orn 5653 . . . . . . . 8  |-  ( F : A -1-1-> B  ->  F : A -1-1-onto-> ran  F )
13 eleq1 2301 . . . . . . . . . . . 12  |-  ( A  =  dom  F  -> 
( A  e.  V  <->  dom 
F  e.  V ) )
14 f1oeq2 5631 . . . . . . . . . . . 12  |-  ( A  =  dom  F  -> 
( F : A -1-1-onto-> ran  F  <-> 
F : dom  F -1-1-onto-> ran  F ) )
1513, 14anbi12d 477 . . . . . . . . . . 11  |-  ( A  =  dom  F  -> 
( ( A  e.  V  /\  F : A
-1-1-onto-> ran  F )  <->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F ) ) )
1615eqcoms 2241 . . . . . . . . . 10  |-  ( dom 
F  =  A  -> 
( ( A  e.  V  /\  F : A
-1-1-onto-> ran  F )  <->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F ) ) )
1716biimpd 144 . . . . . . . . 9  |-  ( dom 
F  =  A  -> 
( ( A  e.  V  /\  F : A
-1-1-onto-> ran  F )  ->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F
) ) )
1817expcomd 1491 . . . . . . . 8  |-  ( dom 
F  =  A  -> 
( F : A -1-1-onto-> ran  F  ->  ( A  e.  V  ->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F ) ) ) )
1911, 12, 18sylc 62 . . . . . . 7  |-  ( F : A -1-1-> B  -> 
( A  e.  V  ->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F ) ) )
2019impcom 125 . . . . . 6  |-  ( ( A  e.  V  /\  F : A -1-1-> B )  ->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F ) )
2120adantr 276 . . . . 5  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F
) )
22 f1oeng 7047 . . . . 5  |-  ( ( dom  F  e.  V  /\  F : dom  F -1-1-onto-> ran  F )  ->  dom  F  ~~  ran  F )
2321, 22syl 14 . . . 4  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  dom  F 
~~  ran  F )
24 enfii 7180 . . . 4  |-  ( ( ran  F  e.  Fin  /\ 
dom  F  ~~  ran  F
)  ->  dom  F  e. 
Fin )
2510, 23, 24syl2anc 415 . . 3  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  dom  F  e.  Fin )
26 f1fun 5604 . . . . 5  |-  ( F : A -1-1-> B  ->  Fun  F )
2726ad2antlr 493 . . . 4  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  Fun  F )
28 fundmfibi 7256 . . . 4  |-  ( Fun 
F  ->  ( F  e.  Fin  <->  dom  F  e.  Fin ) )
2927, 28syl 14 . . 3  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  ( F  e.  Fin  <->  dom  F  e. 
Fin ) )
3025, 29mpbird 167 . 2  |-  ( ( ( A  e.  V  /\  F : A -1-1-> B
)  /\  ran  F  e. 
Fin )  ->  F  e.  Fin )
319, 30impbida 604 1  |-  ( ( A  e.  V  /\  F : A -1-1-> B )  ->  ( F  e. 
Fin 
<->  ran  F  e.  Fin ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4131   `'ccnv 4775   dom cdm 4776   ran crn 4777   Rel wrel 4781   Fun wfun 5374   -1-1->wf1 5377   -1-1-onto->wf1o 5379    ~~ cen 7024   Fincfn 7026
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-1o 6691  df-er 6811  df-en 7027  df-fin 7029
This theorem is used by:  f1vrnfibi  7263
  Copyright terms: Public domain W3C validator