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

Theorem nfrn 4579
Description: Bound-variable hypothesis builder for range. (Contributed by NM, 1-Sep-1999.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypothesis
Ref Expression
nfrn.1  |-  F/_ x A
Assertion
Ref Expression
nfrn  |-  F/_ x ran  A

Proof of Theorem nfrn
StepHypRef Expression
1 df-rn 4356 . 2  |-  ran  A  =  dom  `' A
2 nfrn.1 . . . 4  |-  F/_ x A
32nfcnv 4514 . . 3  |-  F/_ x `' A
43nfdm 4578 . 2  |-  F/_ x dom  `' A
51, 4nfcxfr 2175 1  |-  F/_ x ran  A
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2165   `'ccnv 4344   dom cdm 4345   ran crn 4346
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-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-cnv 4353  df-dm 4355  df-rn 4356
This theorem is referenced by:  nfima  4676  nff  5043  nffo  5105  fliftfun  5436  nfiseq  9218
  Copyright terms: Public domain W3C validator