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

Theorem baseval 13080
Description: Value of the base set extractor. (Normally it is preferred to work with  ( Base `  ndx ) rather than the hard-coded  1 in order to make structure theorems portable. This is an example of how to obtain it when needed.) (New usage is discouraged.) (Contributed by NM, 4-Sep-2011.)
Hypothesis
Ref Expression
baseval.k  |-  K  e. 
_V
Assertion
Ref Expression
baseval  |-  ( Base `  K )  =  ( K `  1 )

Proof of Theorem baseval
StepHypRef Expression
1 baseval.k . 2  |-  K  e. 
_V
2 df-base 13033 . 2  |-  Base  = Slot  1
3 1nn 9117 . 2  |-  1  e.  NN
41, 2, 3strnfvn 13048 1  |-  ( Base `  K )  =  ( K `  1 )
Colors of variables: wff set class
Syntax hints:    = wceq 1395    e. wcel 2200   _Vcvv 2799   ` cfv 5317   1c1 7996   Basecbs 13027
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-1re 8089
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-iota 5277  df-fun 5319  df-fv 5325  df-inn 9107  df-slot 13031  df-base 13033
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator