Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfima | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for image. (Contributed by NM, 30-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
nfima.1 | ⊢ Ⅎ𝑥𝐴 |
nfima.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nfima | ⊢ Ⅎ𝑥(𝐴 “ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ima 5127 | . 2 ⊢ (𝐴 “ 𝐵) = ran (𝐴 ↾ 𝐵) | |
2 | nfima.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | nfima.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
4 | 2, 3 | nfres 5398 | . . 3 ⊢ Ⅎ𝑥(𝐴 ↾ 𝐵) |
5 | 4 | nfrn 5368 | . 2 ⊢ Ⅎ𝑥ran (𝐴 ↾ 𝐵) |
6 | 1, 5 | nfcxfr 2762 | 1 ⊢ Ⅎ𝑥(𝐴 “ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnfc 2751 ran crn 5115 ↾ cres 5116 “ cima 5117 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-xp 5120 df-cnv 5122 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 |
This theorem is referenced by: nfimad 5475 csbima12 5483 nfpred 5685 nfsup 8357 nfoi 8419 nfseq 12811 gsum2d2 18373 ptbasfi 21384 mbfposr 23419 itg1climres 23481 limciun 23658 funimass4f 29437 poimirlem16 33425 poimirlem19 33428 aomclem8 37631 areaquad 37802 binomcxplemdvbinom 38552 binomcxplemdvsum 38554 binomcxplemnotnn0 38555 rfcnpre1 39178 rfcnpre2 39190 smfpimcc 41014 |
Copyright terms: Public domain | W3C validator |