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 4931 . 2 (𝐹:𝐴1-1𝐵 ↔ (𝐹:𝐴𝐵 ∧ Fun 𝐹))
2 nff1.1 . . . 4 𝑥𝐹
3 nff1.2 . . . 4 𝑥𝐴
4 nff1.3 . . . 4 𝑥𝐵
52, 3, 4nff 5068 . . 3 𝑥 𝐹:𝐴𝐵
62nfcnv 4536 . . . 4 𝑥𝐹
76nffun 4948 . . 3 𝑥Fun 𝐹
85, 7nfan 1498 . 2 𝑥(𝐹:𝐴𝐵 ∧ Fun 𝐹)
91, 8nfxfr 1404 1 𝑥 𝐹:𝐴1-1𝐵
Colors of variables: wff set class
Syntax hints:  wa 102  wnf 1390  wnfc 2207  ccnv 4364  Fun wfun 4920  wf 4922  1-1wf1 4923
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-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  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-3an 922  df-tru 1288  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-v 2604  df-un 2978  df-in 2980  df-ss 2987  df-sn 3406  df-pr 3407  df-op 3409  df-br 3788  df-opab 3842  df-rel 4372  df-cnv 4373  df-co 4374  df-dm 4375  df-rn 4376  df-fun 4928  df-fn 4929  df-f 4930  df-f1 4931
This theorem is referenced by:  nff1o  5149
  Copyright terms: Public domain W3C validator