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

Theorem dfrn3 4969
Description: Alternate definition of range. Definition 6.5(2) of [TakeutiZaring] p. 24. (Contributed by NM, 28-Dec-1996.)
Assertion
Ref Expression
dfrn3  |-  ran  A  =  { y  |  E. x <. x ,  y
>.  e.  A }
Distinct variable group:    x, y, A

Proof of Theorem dfrn3
StepHypRef Expression
1 dfrn2 4968 . 2  |-  ran  A  =  { y  |  E. x  x A y }
2 df-br 4131 . . . 4  |-  ( x A y  <->  <. x ,  y >.  e.  A
)
32exbii 1658 . . 3  |-  ( E. x  x A y  <->  E. x <. x ,  y
>.  e.  A )
43abbii 2354 . 2  |-  { y  |  E. x  x A y }  =  { y  |  E. x <. x ,  y
>.  e.  A }
51, 4eqtri 2259 1  |-  ran  A  =  { y  |  E. x <. x ,  y
>.  e.  A }
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402   E.wex 1545    e. wcel 2209   {cab 2224   <.cop 3712   class class class wbr 4130   ran crn 4775
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-cnv 4782  df-dm 4784  df-rn 4785
This theorem is used by:  elrn2g  4970  elrn2  5024  imadmrn  5136  imassrn  5137  csbrng  5249
  Copyright terms: Public domain W3C validator