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

Theorem strslfv2 12007
Description: A variation on strslfv 12008 to avoid asserting that  S itself is a function, which involves sethood of all the ordered pair components of  S. (Contributed by Mario Carneiro, 30-Apr-2015.) (Revised by Jim Kingdon, 30-Jan-2023.)
Hypotheses
Ref Expression
strfv2.s  |-  S  e. 
_V
strfv2.f  |-  Fun  `' `' S
strslfv2.e  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
strfv2.n  |-  <. ( E `  ndx ) ,  C >.  e.  S
Assertion
Ref Expression
strslfv2  |-  ( C  e.  V  ->  C  =  ( E `  S ) )

Proof of Theorem strslfv2
StepHypRef Expression
1 strslfv2.e . 2  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
2 strfv2.s . . 3  |-  S  e. 
_V
32a1i 9 . 2  |-  ( C  e.  V  ->  S  e.  _V )
4 strfv2.f . . 3  |-  Fun  `' `' S
54a1i 9 . 2  |-  ( C  e.  V  ->  Fun  `' `' S )
6 strfv2.n . . 3  |-  <. ( E `  ndx ) ,  C >.  e.  S
76a1i 9 . 2  |-  ( C  e.  V  ->  <. ( E `  ndx ) ,  C >.  e.  S
)
8 id 19 . 2  |-  ( C  e.  V  ->  C  e.  V )
91, 3, 5, 7, 8strslfv2d 12006 1  |-  ( C  e.  V  ->  C  =  ( E `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1331    e. wcel 1480   _Vcvv 2686   <.cop 3530   `'ccnv 4538   Fun wfun 5117   ` cfv 5123   NNcn 8725   ndxcnx 11961  Slot cslot 11963
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
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-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-res 4551  df-iota 5088  df-fun 5125  df-fv 5131  df-slot 11968
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator