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

Theorem nff 5377
Description: Bound-variable hypothesis builder for a mapping. (Contributed by NM, 29-Jan-2004.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nff.1  |-  F/_ x F
nff.2  |-  F/_ x A
nff.3  |-  F/_ x B
Assertion
Ref Expression
nff  |-  F/ x  F : A --> B

Proof of Theorem nff
StepHypRef Expression
1 df-f 5235 . 2  |-  ( F : A --> B  <->  ( F  Fn  A  /\  ran  F  C_  B ) )
2 nff.1 . . . 4  |-  F/_ x F
3 nff.2 . . . 4  |-  F/_ x A
42, 3nffn 5327 . . 3  |-  F/ x  F  Fn  A
52nfrn 4887 . . . 4  |-  F/_ x ran  F
6 nff.3 . . . 4  |-  F/_ x B
75, 6nfss 3163 . . 3  |-  F/ x ran  F  C_  B
84, 7nfan 1576 . 2  |-  F/ x
( F  Fn  A  /\  ran  F  C_  B
)
91, 8nfxfr 1485 1  |-  F/ x  F : A --> B
Colors of variables: wff set class
Syntax hints:    /\ wa 104   F/wnf 1471   F/_wnfc 2319    C_ wss 3144   ran crn 4642    Fn wfn 5226   -->wf 5227
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-sn 3613  df-pr 3614  df-op 3616  df-br 4019  df-opab 4080  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-fun 5233  df-fn 5234  df-f 5235
This theorem is referenced by:  nff1  5434
  Copyright terms: Public domain W3C validator