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

Theorem f1ofveu 5910
Description: There is one domain element for each value of a one-to-one onto function. (Contributed by NM, 26-May-2006.)
Assertion
Ref Expression
f1ofveu  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  ( F `  x )  =  C )
Distinct variable groups:    x, A    x, B    x, C    x, F

Proof of Theorem f1ofveu
StepHypRef Expression
1 f1ocnv 5517 . . . 4  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
2 f1of 5504 . . . 4  |-  ( `' F : B -1-1-onto-> A  ->  `' F : B --> A )
31, 2syl 14 . . 3  |-  ( F : A -1-1-onto-> B  ->  `' F : B --> A )
4 feu 5440 . . 3  |-  ( ( `' F : B --> A  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
53, 4sylan 283 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
6 f1ocnvfvb 5827 . . . . . 6  |-  ( ( F : A -1-1-onto-> B  /\  x  e.  A  /\  C  e.  B )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
763com23 1211 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
8 dff1o4 5512 . . . . . . 7  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
98simprbi 275 . . . . . 6  |-  ( F : A -1-1-onto-> B  ->  `' F  Fn  B )
10 fnopfvb 5602 . . . . . . 7  |-  ( ( `' F  Fn  B  /\  C  e.  B
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
11103adant3 1019 . . . . . 6  |-  ( ( `' F  Fn  B  /\  C  e.  B  /\  x  e.  A
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
129, 11syl3an1 1282 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F ) )
137, 12bitrd 188 . . . 4  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <->  <. C ,  x >.  e.  `' F ) )
14133expa 1205 . . 3  |-  ( ( ( F : A -1-1-onto-> B  /\  C  e.  B
)  /\  x  e.  A )  ->  (
( F `  x
)  =  C  <->  <. C ,  x >.  e.  `' F
) )
1514reubidva 2680 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  ( E! x  e.  A  ( F `  x )  =  C  <-> 
E! x  e.  A  <. C ,  x >.  e.  `' F ) )
165, 15mpbird 167 1  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  ( F `  x )  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167   E!wreu 2477   <.cop 3625   `'ccnv 4662    Fn wfn 5253   -->wf 5254   -1-1-onto->wf1o 5257   ` cfv 5258
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266
This theorem is referenced by:  1arith2  12537
  Copyright terms: Public domain W3C validator