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

Theorem nfima 4676
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 4358 . 2  |-  ( A
" B )  =  ran  ( A  |`  B )
2 nfima.1 . . . 4  |-  F/_ x A
3 nfima.2 . . . 4  |-  F/_ x B
42, 3nfres 4614 . . 3  |-  F/_ x
( A  |`  B )
54nfrn 4579 . 2  |-  F/_ x ran  ( A  |`  B )
61, 5nfcxfr 2175 1  |-  F/_ x
( A " B
)
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2165   ran crn 4346    |` cres 4347   "cima 4348
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 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rab 2315  df-v 2559  df-un 2922  df-in 2924  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-xp 4351  df-cnv 4353  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358
This theorem is referenced by:  nfimad  4677  csbima12g  4686
  Copyright terms: Public domain W3C validator