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

Theorem 2stropg 13284
Description: The other slot of a constructed two-slot structure. (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 28-Jan-2023.)
Hypotheses
Ref Expression
2str.g  |-  G  =  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. }
2str.e  |-  E  = Slot 
N
2str.l  |-  1  <  N
2str.n  |-  N  e.  NN
Assertion
Ref Expression
2stropg  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  .+  =  ( E `  G ) )

Proof of Theorem 2stropg
StepHypRef Expression
1 2str.e . . 3  |-  E  = Slot 
N
2 2str.n . . 3  |-  N  e.  NN
31, 2ndxslid 13187 . 2  |-  ( E  = Slot  ( E `  ndx )  /\  ( E `  ndx )  e.  NN )
4 2str.g . . 3  |-  G  =  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. }
5 basendxnn 13218 . . . . . 6  |-  ( Base `  ndx )  e.  NN
65a1i 9 . . . . 5  |-  ( ( B  e.  V  /\  .+  e.  W )  -> 
( Base `  ndx )  e.  NN )
7 simpl 109 . . . . 5  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  B  e.  V )
8 opexg 4326 . . . . 5  |-  ( ( ( Base `  ndx )  e.  NN  /\  B  e.  V )  ->  <. ( Base `  ndx ) ,  B >.  e.  _V )
96, 7, 8syl2anc 411 . . . 4  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  <. ( Base `  ndx ) ,  B >.  e. 
_V )
101, 2ndxarg 13185 . . . . . . 7  |-  ( E `
 ndx )  =  N
1110, 2eqeltri 2304 . . . . . 6  |-  ( E `
 ndx )  e.  NN
1211a1i 9 . . . . 5  |-  ( ( B  e.  V  /\  .+  e.  W )  -> 
( E `  ndx )  e.  NN )
13 simpr 110 . . . . 5  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  .+  e.  W )
14 opexg 4326 . . . . 5  |-  ( ( ( E `  ndx )  e.  NN  /\  .+  e.  W )  ->  <. ( E `  ndx ) , 
.+  >.  e.  _V )
1512, 13, 14syl2anc 411 . . . 4  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  <. ( E `  ndx ) ,  .+  >.  e.  _V )
16 prexg 4307 . . . 4  |-  ( (
<. ( Base `  ndx ) ,  B >.  e. 
_V  /\  <. ( E `
 ndx ) , 
.+  >.  e.  _V )  ->  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. }  e.  _V )
179, 15, 16syl2anc 411 . . 3  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. }  e.  _V )
184, 17eqeltrid 2318 . 2  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  G  e.  _V )
195nnrei 9211 . . . . . 6  |-  ( Base `  ndx )  e.  RR
20 2str.l . . . . . . 7  |-  1  <  N
21 basendx 13217 . . . . . . 7  |-  ( Base `  ndx )  =  1
2220, 21, 103brtr4i 4123 . . . . . 6  |-  ( Base `  ndx )  <  ( E `  ndx )
2319, 22ltneii 8335 . . . . 5  |-  ( Base `  ndx )  =/=  ( E `  ndx )
2423a1i 9 . . . 4  |-  ( ( B  e.  V  /\  .+  e.  W )  -> 
( Base `  ndx )  =/=  ( E `  ndx ) )
25 funprg 5387 . . . 4  |-  ( ( ( ( Base `  ndx )  e.  NN  /\  ( E `  ndx )  e.  NN )  /\  ( B  e.  V  /\  .+  e.  W )  /\  ( Base `  ndx )  =/=  ( E `  ndx ) )  ->  Fun  {
<. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. } )
266, 12, 7, 13, 24, 25syl221anc 1285 . . 3  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  Fun  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. } )
274funeqi 5354 . . 3  |-  ( Fun 
G  <->  Fun  { <. ( Base `  ndx ) ,  B >. ,  <. ( E `  ndx ) , 
.+  >. } )
2826, 27sylibr 134 . 2  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  Fun  G )
29 prid2g 3780 . . . 4  |-  ( <.
( E `  ndx ) ,  .+  >.  e.  _V  -> 
<. ( E `  ndx ) ,  .+  >.  e.  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. } )
3015, 29syl 14 . . 3  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  <. ( E `  ndx ) ,  .+  >.  e.  { <. ( Base `  ndx ) ,  B >. , 
<. ( E `  ndx ) ,  .+  >. } )
3130, 4eleqtrrdi 2325 . 2  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  <. ( E `  ndx ) ,  .+  >.  e.  G
)
323, 18, 28, 31strslfvd 13204 1  |-  ( ( B  e.  V  /\  .+  e.  W )  ->  .+  =  ( E `  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202    =/= wne 2403   _Vcvv 2803   {cpr 3674   <.cop 3676   class class class wbr 4093   Fun wfun 5327   ` cfv 5333   1c1 8093    < clt 8273   NNcn 9202   ndxcnx 13159  Slot cslot 13161   Basecbs 13162
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1re 8186  ax-addrcl 8189  ax-pre-ltirr 8204
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fv 5341  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-ndx 13165  df-slot 13166  df-base 13168
This theorem is referenced by:  grpplusgg  13291  eltpsg  14851
  Copyright terms: Public domain W3C validator