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

Theorem funopabeq 5390
Description: A class of ordered pairs of values is a function. (Contributed by NM, 14-Nov-1995.)
Assertion
Ref Expression
funopabeq  |-  Fun  { <. x ,  y >.  |  y  =  A }
Distinct variable groups:    x, y    y, A
Allowed substitution hint:    A( x)

Proof of Theorem funopabeq
StepHypRef Expression
1 funopab 5389 . 2  |-  ( Fun 
{ <. x ,  y
>.  |  y  =  A }  <->  A. x E* y 
y  =  A )
2 moeq 2994 . 2  |-  E* y 
y  =  A
31, 2mpgbir 1502 1  |-  Fun  { <. x ,  y >.  |  y  =  A }
Colors of variables: wff set class
Syntax hints:    = wceq 1398   E*wmo 2083   {copab 4172   Fun wfun 5348
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 4230  ax-pow 4289  ax-pr 4324
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 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-br 4112  df-opab 4174  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-fun 5356
This theorem is referenced by:  funopab4  5391
  Copyright terms: Public domain W3C validator