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

Theorem funoprabg 6115
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 4789 . . 3  |-  ( A. x A. y E* z ph  ->  E* z E. x E. y ( w  =  <. x ,  y >.  /\  ph ) )
21alrimiv 1920 . 2  |-  ( A. x A. y E* z ph  ->  A. w E* z E. x E. y ( w  =  <. x ,  y >.  /\  ph ) )
3 dfoprab2 6063 . . . 4  |-  { <. <.
x ,  y >. ,  z >.  |  ph }  =  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) }
43funeqi 5345 . . 3  |-  ( Fun 
{ <. <. x ,  y
>. ,  z >.  | 
ph }  <->  Fun  { <. w ,  z >.  |  E. x E. y ( w  =  <. x ,  y
>.  /\  ph ) } )
5 funopab 5359 . . 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 1393    = wceq 1395   E.wex 1538   E*wmo 2078   <.cop 3670   {copab 4147   Fun wfun 5318   {coprab 6014
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-fun 5326  df-oprab 6017
This theorem is referenced by:  funoprab  6116  fnoprabg  6117  oprabexd  6284
  Copyright terms: Public domain W3C validator