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

Theorem nff1 5031
Description: Bound-variable hypothesis builder for a one-to-one function. (Contributed by NM, 16-May-2004.)
Hypotheses
Ref Expression
nff1.1 x𝐹
nff1.2 xA
nff1.3 xB
Assertion
Ref Expression
nff1 x 𝐹:A1-1B

Proof of Theorem nff1
StepHypRef Expression
1 df-f1 4849 . 2 (𝐹:A1-1B ↔ (𝐹:AB Fun 𝐹))
2 nff1.1 . . . 4 x𝐹
3 nff1.2 . . . 4 xA
4 nff1.3 . . . 4 xB
52, 3, 4nff 4984 . . 3 x 𝐹:AB
62nfcnv 4456 . . . 4 x𝐹
76nffun 4865 . . 3 xFun 𝐹
85, 7nfan 1454 . 2 x(𝐹:AB Fun 𝐹)
91, 8nfxfr 1360 1 x 𝐹:A1-1B
Colors of variables: wff set class
Syntax hints:   wa 97  wnf 1346  wnfc 2162  ccnv 4286  Fun wfun 4838  wf 4840  1-1wf1 4841
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305  df-v 2553  df-un 2916  df-in 2918  df-ss 2925  df-sn 3372  df-pr 3373  df-op 3375  df-br 3755  df-opab 3809  df-rel 4294  df-cnv 4295  df-co 4296  df-dm 4297  df-rn 4298  df-fun 4846  df-fn 4847  df-f 4848  df-f1 4849
This theorem is referenced by:  nff1o  5065
  Copyright terms: Public domain W3C validator