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

Theorem dffn3 5084
Description: A function maps to its range. (Contributed by NM, 1-Sep-1999.)
Assertion
Ref Expression
dffn3  |-  ( F  Fn  A  <->  F : A
--> ran  F )

Proof of Theorem dffn3
StepHypRef Expression
1 ssid 3019 . . 3  |-  ran  F  C_ 
ran  F
21biantru 296 . 2  |-  ( F  Fn  A  <->  ( F  Fn  A  /\  ran  F  C_ 
ran  F ) )
3 df-f 4936 . 2  |-  ( F : A --> ran  F  <->  ( F  Fn  A  /\  ran  F  C_  ran  F ) )
42, 3bitr4i 185 1  |-  ( F  Fn  A  <->  F : A
--> ran  F )
Colors of variables: wff set class
Syntax hints:    /\ wa 102    <-> wb 103    C_ wss 2974   ran crn 4372    Fn wfn 4927   -->wf 4928
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-11 1438  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064
This theorem depends on definitions:  df-bi 115  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-in 2980  df-ss 2987  df-f 4936
This theorem is referenced by:  fsn2  5369  fo2ndf  5879
  Copyright terms: Public domain W3C validator