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

Theorem nff1 5115
Description: Bound-variable hypothesis builder for a one-to-one function. (Contributed by NM, 16-May-2004.)
Hypotheses
Ref Expression
nff1.1 𝑥𝐹
nff1.2 𝑥𝐴
nff1.3 𝑥𝐵
Assertion
Ref Expression
nff1 𝑥 𝐹:𝐴1-1𝐵

Proof of Theorem nff1
StepHypRef Expression
1 df-f1 4932 . 2 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ Fun 𝐹))
2 nff1.1 . . . 4 𝑥𝐹
3 nff1.2 . . . 4 𝑥𝐴
4 nff1.3 . . . 4 𝑥𝐵
52, 3, 4nff 5068 . . 3 𝑥 𝐹:𝐴𝐵
62nfcnv 4539 . . . 4 𝑥𝐹
76nffun 4949 . . 3 𝑥Fun 𝐹
85, 7nfan 1471 . 2 𝑥(𝐹:𝐴𝐵 ∧ Fun 𝐹)
91, 8nfxfr 1377 1 𝑥 𝐹:𝐴1-1𝐵
Colors of variables: wff set class
Syntax hints:  wa 101  wnf 1363  wnfc 2179  ccnv 4369  Fun wfun 4921  wf 4923  1-1wf1 4924
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 638  ax-5 1350  ax-7 1351  ax-gen 1352  ax-ie1 1396  ax-ie2 1397  ax-8 1409  ax-10 1410  ax-11 1411  ax-i12 1412  ax-bndl 1413  ax-4 1414  ax-17 1433  ax-i9 1437  ax-ial 1441  ax-i5r 1442  ax-ext 2036
This theorem depends on definitions:  df-bi 114  df-3an 896  df-tru 1260  df-nf 1364  df-sb 1660  df-clab 2041  df-cleq 2047  df-clel 2050  df-nfc 2181  df-ral 2326  df-v 2574  df-un 2947  df-in 2949  df-ss 2956  df-sn 3406  df-pr 3407  df-op 3409  df-br 3790  df-opab 3844  df-rel 4377  df-cnv 4378  df-co 4379  df-dm 4380  df-rn 4381  df-fun 4929  df-fn 4930  df-f 4931  df-f1 4932
This theorem is referenced by:  nff1o  5149
  Copyright terms: Public domain W3C validator