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

Theorem nfima 4884
Description: Bound-variable hypothesis builder for image. (Contributed by NM, 30-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Hypotheses
Ref Expression
nfima.1  |-  F/_ x A
nfima.2  |-  F/_ x B
Assertion
Ref Expression
nfima  |-  F/_ x
( A " B
)

Proof of Theorem nfima
StepHypRef Expression
1 df-ima 4547 . 2  |-  ( A
" B )  =  ran  ( A  |`  B )
2 nfima.1 . . . 4  |-  F/_ x A
3 nfima.2 . . . 4  |-  F/_ x B
42, 3nfres 4816 . . 3  |-  F/_ x
( A  |`  B )
54nfrn 4779 . 2  |-  F/_ x ran  ( A  |`  B )
61, 5nfcxfr 2276 1  |-  F/_ x
( A " B
)
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2266   ran crn 4535    |` cres 4536   "cima 4537
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rab 2423  df-v 2683  df-un 3070  df-in 3072  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-xp 4540  df-cnv 4542  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547
This theorem is referenced by:  nfimad  4885  csbima12g  4895
  Copyright terms: Public domain W3C validator