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

Theorem fnasrn 5642
Description: A function expressed as the range of another function. (Contributed by Mario Carneiro, 22-Jun-2013.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Hypothesis
Ref Expression
dfmpt.1  |-  B  e. 
_V
Assertion
Ref Expression
fnasrn  |-  ( x  e.  A  |->  B )  =  ran  ( x  e.  A  |->  <. x ,  B >. )

Proof of Theorem fnasrn
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 dfmpt.1 . . 3  |-  B  e. 
_V
21dfmpt 5641 . 2  |-  ( x  e.  A  |->  B )  =  U_ x  e.  A  { <. x ,  B >. }
3 eqid 2157 . . . . 5  |-  ( x  e.  A  |->  <. x ,  B >. )  =  ( x  e.  A  |->  <.
x ,  B >. )
43rnmpt 4831 . . . 4  |-  ran  (
x  e.  A  |->  <.
x ,  B >. )  =  { y  |  E. x  e.  A  y  =  <. x ,  B >. }
5 velsn 3577 . . . . . 6  |-  ( y  e.  { <. x ,  B >. }  <->  y  =  <. x ,  B >. )
65rexbii 2464 . . . . 5  |-  ( E. x  e.  A  y  e.  { <. x ,  B >. }  <->  E. x  e.  A  y  =  <. x ,  B >. )
76abbii 2273 . . . 4  |-  { y  |  E. x  e.  A  y  e.  { <. x ,  B >. } }  =  { y  |  E. x  e.  A  y  =  <. x ,  B >. }
84, 7eqtr4i 2181 . . 3  |-  ran  (
x  e.  A  |->  <.
x ,  B >. )  =  { y  |  E. x  e.  A  y  e.  { <. x ,  B >. } }
9 df-iun 3851 . . 3  |-  U_ x  e.  A  { <. x ,  B >. }  =  {
y  |  E. x  e.  A  y  e.  {
<. x ,  B >. } }
108, 9eqtr4i 2181 . 2  |-  ran  (
x  e.  A  |->  <.
x ,  B >. )  =  U_ x  e.  A  { <. x ,  B >. }
112, 10eqtr4i 2181 1  |-  ( x  e.  A  |->  B )  =  ran  ( x  e.  A  |->  <. x ,  B >. )
Colors of variables: wff set class
Syntax hints:    = wceq 1335    e. wcel 2128   {cab 2143   E.wrex 2436   _Vcvv 2712   {csn 3560   <.cop 3563   U_ciun 3849    |-> cmpt 4025   ran crn 4584
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4134  ax-pr 4168
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-reu 2442  df-v 2714  df-sbc 2938  df-csb 3032  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-iun 3851  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4252  df-xp 4589  df-rel 4590  df-cnv 4591  df-co 4592  df-dm 4593  df-rn 4594  df-fun 5169  df-fn 5170  df-f 5171  df-f1 5172  df-fo 5173  df-f1o 5174
This theorem is referenced by:  idref  5702
  Copyright terms: Public domain W3C validator