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

Theorem f1ofveu 5500
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 5139 . . . 4  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
2 f1of 5126 . . . 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 5072 . . 3  |-  ( ( `' F : B --> A  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
53, 4sylan 267 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
6 f1ocnvfvb 5420 . . . . . 6  |-  ( ( F : A -1-1-onto-> B  /\  x  e.  A  /\  C  e.  B )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
763com23 1110 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
8 dff1o4 5134 . . . . . . 7  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
98simprbi 260 . . . . . 6  |-  ( F : A -1-1-onto-> B  ->  `' F  Fn  B )
10 fnopfvb 5215 . . . . . . 7  |-  ( ( `' F  Fn  B  /\  C  e.  B
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
11103adant3 924 . . . . . 6  |-  ( ( `' F  Fn  B  /\  C  e.  B  /\  x  e.  A
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
129, 11syl3an1 1168 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F ) )
137, 12bitrd 177 . . . 4  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <->  <. C ,  x >.  e.  `' F ) )
14133expa 1104 . . 3  |-  ( ( ( F : A -1-1-onto-> B  /\  C  e.  B
)  /\  x  e.  A )  ->  (
( F `  x
)  =  C  <->  <. C ,  x >.  e.  `' F
) )
1514reubidva 2492 . 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 156 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 97    <-> wb 98    /\ w3a 885    = wceq 1243    e. wcel 1393   E!wreu 2308   <.cop 3378   `'ccnv 4344    Fn wfn 4897   -->wf 4898   -1-1-onto->wf1o 4901   ` cfv 4902
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator