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

Theorem nff 5442
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 5294 . 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 5389 . . 3  |-  F/ x  F  Fn  A
52nfrn 4942 . . . 4  |-  F/_ x ran  F
6 nff.3 . . . 4  |-  F/_ x B
75, 6nfss 3194 . . 3  |-  F/ x ran  F  C_  B
84, 7nfan 1589 . 2  |-  F/ x
( F  Fn  A  /\  ran  F  C_  B
)
91, 8nfxfr 1498 1  |-  F/ x  F : A --> B
Colors of variables: wff set class
Syntax hints:    /\ wa 104   F/wnf 1484   F/_wnfc 2337    C_ wss 3174   ran crn 4694    Fn wfn 5285   -->wf 5286
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-fun 5292  df-fn 5293  df-f 5294
This theorem is referenced by:  nff1  5501  nfwrd  11059  lfgrnloopen  15839
  Copyright terms: Public domain W3C validator