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

Theorem nff1 5421
Description: Bound-variable hypothesis builder for a one-to-one function. (Contributed by NM, 16-May-2004.)
Hypotheses
Ref Expression
nff1.1  |-  F/_ x F
nff1.2  |-  F/_ x A
nff1.3  |-  F/_ x B
Assertion
Ref Expression
nff1  |-  F/ x  F : A -1-1-> B

Proof of Theorem nff1
StepHypRef Expression
1 df-f1 5223 . 2  |-  ( F : A -1-1-> B  <->  ( F : A --> B  /\  Fun  `' F ) )
2 nff1.1 . . . 4  |-  F/_ x F
3 nff1.2 . . . 4  |-  F/_ x A
4 nff1.3 . . . 4  |-  F/_ x B
52, 3, 4nff 5364 . . 3  |-  F/ x  F : A --> B
62nfcnv 4808 . . . 4  |-  F/_ x `' F
76nffun 5241 . . 3  |-  F/ x Fun  `' F
85, 7nfan 1565 . 2  |-  F/ x
( F : A --> B  /\  Fun  `' F
)
91, 8nfxfr 1474 1  |-  F/ x  F : A -1-1-> B
Colors of variables: wff set class
Syntax hints:    /\ wa 104   F/wnf 1460   F/_wnfc 2306   `'ccnv 4627   Fun wfun 5212   -->wf 5214   -1-1->wf1 5215
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223
This theorem is referenced by:  nff1o  5461
  Copyright terms: Public domain W3C validator