Theorem baseval 12011

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

Step	Hyp	Ref	Expression
1		baseval.k	. 2 |- K e. _V
2		df-base 11965	. 2 |- Base = Slot 1
3		1nn 8731	. 2 |- 1 e. NN
4	1, 2, 3	strnfvn 11980	1 |- ( Base ` K ) = ( K ` 1 )

Syntax hints:   = wceq 1331   e. wcel 1480   _Vcvv 2686   ` cfv 5123   1c1 7621   Basecbs 11959

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-1re 7714

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-iota 5088  df-fun 5125  df-fv 5131  df-inn 8721  df-slot 11963  df-base 11965

This theorem is referenced by: (None)