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

Theorem s1rn 11244
Description: The range of a singleton word. (Contributed by Mario Carneiro, 18-Jul-2016.)
Assertion
Ref Expression
s1rn  |-  ( A  e.  V  ->  ran  <" A ">  =  { A } )

Proof of Theorem s1rn
StepHypRef Expression
1 s1val 11243 . . 3  |-  ( A  e.  V  ->  <" A ">  =  { <. 0 ,  A >. } )
21rneqd 4967 . 2  |-  ( A  e.  V  ->  ran  <" A ">  =  ran  { <. 0 ,  A >. } )
3 c0ex 8216 . . 3  |-  0  e.  _V
43rnsnop 5224 . 2  |-  ran  { <. 0 ,  A >. }  =  { A }
52, 4eqtrdi 2280 1  |-  ( A  e.  V  ->  ran  <" A ">  =  { A } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202   {csn 3673   <.cop 3676   ran crn 4732   0cc0 8075   <"cs1 11241
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-1cn 8168  ax-icn 8170  ax-addcl 8171  ax-mulcl 8173  ax-i2m1 8180
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fv 5341  df-s1 11242
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator