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

Theorem dfrnf 4866
Description: Definition of range, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 14-Aug-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
dfrnf.1  |-  F/_ x A
dfrnf.2  |-  F/_ y A
Assertion
Ref Expression
dfrnf  |-  ran  A  =  { y  |  E. x  x A y }
Distinct variable group:    x, y
Allowed substitution hints:    A( x, y)

Proof of Theorem dfrnf
Dummy variables  w  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfrn2 4813 . 2  |-  ran  A  =  { w  |  E. v  v A w }
2 nfcv 2319 . . . . 5  |-  F/_ x
v
3 dfrnf.1 . . . . 5  |-  F/_ x A
4 nfcv 2319 . . . . 5  |-  F/_ x w
52, 3, 4nfbr 4048 . . . 4  |-  F/ x  v A w
6 nfv 1528 . . . 4  |-  F/ v  x A w
7 breq1 4005 . . . 4  |-  ( v  =  x  ->  (
v A w  <->  x A w ) )
85, 6, 7cbvex 1756 . . 3  |-  ( E. v  v A w  <->  E. x  x A w )
98abbii 2293 . 2  |-  { w  |  E. v  v A w }  =  {
w  |  E. x  x A w }
10 nfcv 2319 . . . . 5  |-  F/_ y
x
11 dfrnf.2 . . . . 5  |-  F/_ y A
12 nfcv 2319 . . . . 5  |-  F/_ y
w
1310, 11, 12nfbr 4048 . . . 4  |-  F/ y  x A w
1413nfex 1637 . . 3  |-  F/ y E. x  x A w
15 nfv 1528 . . 3  |-  F/ w E. x  x A
y
16 breq2 4006 . . . 4  |-  ( w  =  y  ->  (
x A w  <->  x A
y ) )
1716exbidv 1825 . . 3  |-  ( w  =  y  ->  ( E. x  x A w 
<->  E. x  x A y ) )
1814, 15, 17cbvab 2301 . 2  |-  { w  |  E. x  x A w }  =  {
y  |  E. x  x A y }
191, 9, 183eqtri 2202 1  |-  ran  A  =  { y  |  E. x  x A y }
Colors of variables: wff set class
Syntax hints:    = wceq 1353   E.wex 1492   {cab 2163   F/_wnfc 2306   class class class wbr 4002   ran crn 4626
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-cnv 4633  df-dm 4635  df-rn 4636
This theorem is referenced by:  rnopab  4872
  Copyright terms: Public domain W3C validator