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

Theorem funoprabg 6160
Description: "At most one" is a sufficient condition for an operation class abstraction to be a function. (Contributed by NM, 28-Aug-2007.)
Assertion
Ref Expression
funoprabg  |-  ( A. x A. y E* z ph  ->  Fun  { <. <. x ,  y >. ,  z
>.  |  ph } )
Distinct variable group:    x, y, z
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem funoprabg
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 mosubopt 4820 . . 3  |-  ( A. x A. y E* z ph  ->  E* z E. x E. y ( w  =  <. x ,  y >.  /\  ph ) )
21alrimiv 1923 . 2  |-  ( A. x A. y E* z ph  ->  A. w E* z E. x E. y ( w  =  <. x ,  y >.  /\  ph ) )
3 dfoprab2 6108 . . . 4  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
43funeqi 5378 . . 3  |-  ( Fun 
{ <. <. x ,  y
>. ,  z >.  | 
ph }  <->  Fun  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) } )
5 funopab 5392 . . 3  |-  ( Fun 
{ <. w ,  z
>.  |  E. x E. y ( w  = 
<. x ,  y >.  /\  ph ) }  <->  A. w E* z E. x E. y ( w  = 
<. x ,  y >.  /\  ph ) )
64, 5bitr2i 185 . 2  |-  ( A. w E* z E. x E. y ( w  = 
<. x ,  y >.  /\  ph )  <->  Fun  { <. <.
x ,  y >. ,  z >.  |  ph } )
72, 6sylib 122 1  |-  ( A. x A. y E* z ph  ->  Fun  { <. <. x ,  y >. ,  z
>.  |  ph } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1396    = wceq 1398   E.wex 1541   E*wmo 2083   <.cop 3697   {copab 4175   Fun wfun 5351   {coprab 6059
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-fun 5359  df-oprab 6062
This theorem is referenced by:  funoprab  6161  fnoprabg  6162  oprabexd  6333
  Copyright terms: Public domain W3C validator