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

Theorem opprsllem 14053
Description: Lemma for opprbasg 14054 and oppraddg 14055. (Contributed by Mario Carneiro, 1-Dec-2014.) (Revised by AV, 6-Nov-2024.)
Hypotheses
Ref Expression
opprbas.1  |-  O  =  (oppr
`  R )
opprsllem.2  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
opprlem.3  |-  ( E `
 ndx )  =/=  ( .r `  ndx )
Assertion
Ref Expression
opprsllem  |-  ( R  e.  V  ->  ( E `  R )  =  ( E `  O ) )

Proof of Theorem opprsllem
StepHypRef Expression
1 mulrslid 13181 . . . . 5  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
21slotex 13075 . . . 4  |-  ( R  e.  V  ->  ( .r `  R )  e. 
_V )
3 tposexg 6410 . . . 4  |-  ( ( .r `  R )  e.  _V  -> tpos  ( .r
`  R )  e. 
_V )
42, 3syl 14 . . 3  |-  ( R  e.  V  -> tpos  ( .r
`  R )  e. 
_V )
5 opprsllem.2 . . . 4  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
6 opprlem.3 . . . 4  |-  ( E `
 ndx )  =/=  ( .r `  ndx )
71simpri 113 . . . 4  |-  ( .r
`  ndx )  e.  NN
85, 6, 7setsslnid 13100 . . 3  |-  ( ( R  e.  V  /\ tpos  ( .r `  R )  e.  _V )  -> 
( E `  R
)  =  ( E `
 ( R sSet  <. ( .r `  ndx ) , tpos  ( .r `  R
) >. ) ) )
94, 8mpdan 421 . 2  |-  ( R  e.  V  ->  ( E `  R )  =  ( E `  ( R sSet  <. ( .r
`  ndx ) , tpos  ( .r `  R ) >.
) ) )
10 eqid 2229 . . . 4  |-  ( Base `  R )  =  (
Base `  R )
11 eqid 2229 . . . 4  |-  ( .r
`  R )  =  ( .r `  R
)
12 opprbas.1 . . . 4  |-  O  =  (oppr
`  R )
1310, 11, 12opprvalg 14048 . . 3  |-  ( R  e.  V  ->  O  =  ( R sSet  <. ( .r `  ndx ) , tpos  ( .r `  R
) >. ) )
1413fveq2d 5633 . 2  |-  ( R  e.  V  ->  ( E `  O )  =  ( E `  ( R sSet  <. ( .r
`  ndx ) , tpos  ( .r `  R ) >.
) ) )
159, 14eqtr4d 2265 1  |-  ( R  e.  V  ->  ( E `  R )  =  ( E `  O ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    =/= wne 2400   _Vcvv 2799   <.cop 3669   ` cfv 5318  (class class class)co 6007  tpos ctpos 6396   NNcn 9121   ndxcnx 13045   sSet csts 13046  Slot cslot 13047   Basecbs 13048   .rcmulr 13127  opprcoppr 14046
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-in1 617  ax-in2 618  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 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1re 8104  ax-addrcl 8107
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  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-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326  df-ov 6010  df-oprab 6011  df-mpo 6012  df-tpos 6397  df-inn 9122  df-2 9180  df-3 9181  df-ndx 13051  df-slot 13052  df-sets 13055  df-mulr 13140  df-oppr 14047
This theorem is referenced by:  opprbasg  14054  oppraddg  14055
  Copyright terms: Public domain W3C validator