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

Theorem strslfv2 13396
Description: A variation on strslfv 13397 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 13395 1  |-  ( C  e.  V  ->  C  =  ( E `  S ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   <.cop 3712   `'ccnv 4773   Fun wfun 5371   ` cfv 5377   NNcn 9304   ndxcnx 13349  Slot cslot 13351
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-slot 13356
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator