MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dffun4 Structured version   Unicode version

Theorem dffun4 5458
Description: Alternate definition of a function. Definition 6.4(4) of [TakeutiZaring] p. 24. (Contributed by NM, 29-Dec-1996.)
Assertion
Ref Expression
dffun4  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x A. y A. z ( ( <.
x ,  y >.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) ) )
Distinct variable group:    x, y, z, A

Proof of Theorem dffun4
StepHypRef Expression
1 dffun2 5456 . 2  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x A. y A. z ( ( x A y  /\  x A z )  -> 
y  =  z ) ) )
2 df-br 4205 . . . . . . 7  |-  ( x A y  <->  <. x ,  y >.  e.  A
)
3 df-br 4205 . . . . . . 7  |-  ( x A z  <->  <. x ,  z >.  e.  A
)
42, 3anbi12i 679 . . . . . 6  |-  ( ( x A y  /\  x A z )  <->  ( <. x ,  y >.  e.  A  /\  <. x ,  z
>.  e.  A ) )
54imbi1i 316 . . . . 5  |-  ( ( ( x A y  /\  x A z )  ->  y  =  z )  <->  ( ( <. x ,  y >.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) )
65albii 1575 . . . 4  |-  ( A. z ( ( x A y  /\  x A z )  -> 
y  =  z )  <->  A. z ( ( <.
x ,  y >.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) )
762albii 1576 . . 3  |-  ( A. x A. y A. z
( ( x A y  /\  x A z )  ->  y  =  z )  <->  A. x A. y A. z ( ( <. x ,  y
>.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) )
87anbi2i 676 . 2  |-  ( ( Rel  A  /\  A. x A. y A. z
( ( x A y  /\  x A z )  ->  y  =  z ) )  <-> 
( Rel  A  /\  A. x A. y A. z ( ( <.
x ,  y >.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) ) )
91, 8bitri 241 1  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x A. y A. z ( ( <.
x ,  y >.  e.  A  /\  <. x ,  z >.  e.  A
)  ->  y  =  z ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359   A.wal 1549    e. wcel 1725   <.cop 3809   class class class wbr 4204   Rel wrel 4875   Fun wfun 5440
This theorem is referenced by:  funopg  5477  funun  5487  fununi  5509  tfrlem7  6636  hashfun  11692  dffun10  25751  elfuns  25752  bnj1379  29139
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-id 4490  df-cnv 4878  df-co 4879  df-fun 5448
  Copyright terms: Public domain W3C validator