ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  swrdval Unicode version
Theorem swrdval 11442
Description: Value of a subword. (Contributed by Stefan O'Rear, 15-Aug-2015.)
Assertion
Ref Expression
swrdval |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( S substr <. F , L >. ) = if ( ( F..^ L ) C_ dom S , ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) , (/) ) )
Distinct variable groups:   x, S   x, F   x, L   x, V
Proof of Theorem swrdval
Dummy variables s b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-substr 11440 . . 3 |- substr = ( s e. _V , b e. ( ZZ X. ZZ ) |-> if ( ( ( 1st ` b )..^ ( 2nd ` b ) ) C_ dom s , ( x e. ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) |-> ( s ` ( x + ( 1st ` b ) ) ) ) , (/) ) )
21a1i 9 . 2 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> substr = ( s e. _V , b e. ( ZZ X. ZZ ) |-> if ( ( ( 1st ` b )..^ ( 2nd ` b ) ) C_ dom s , ( x e. ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) |-> ( s ` ( x + ( 1st ` b ) ) ) ) , (/) ) ) )
3 simprl 535 . . 3 |- ( ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) /\ ( s = S /\ b = <. F , L >. ) ) -> s = S )
4 fveq2 5698 . . . . 5 |- ( b = <. F , L >. -> ( 1st ` b ) = ( 1st ` <. F , L >. ) )
54adantl 277 . . . 4 |- ( ( s = S /\ b = <. F , L >. ) -> ( 1st ` b ) = ( 1st ` <. F , L >. ) )
6 op1stg 6388 . . . . 5 |- ( ( F e. ZZ /\ L e. ZZ ) -> ( 1st ` <. F , L >. ) = F )
763adant1 1046 . . . 4 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( 1st ` <. F , L >. ) = F )
85, 7sylan9eqr 2293 . . 3 |- ( ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) /\ ( s = S /\ b = <. F , L >. ) ) -> ( 1st ` b ) = F )
9 fveq2 5698 . . . . 5 |- ( b = <. F , L >. -> ( 2nd ` b ) = ( 2nd ` <. F , L >. ) )
109adantl 277 . . . 4 |- ( ( s = S /\ b = <. F , L >. ) -> ( 2nd ` b ) = ( 2nd ` <. F , L >. ) )
11 op2ndg 6389 . . . . 5 |- ( ( F e. ZZ /\ L e. ZZ ) -> ( 2nd ` <. F , L >. ) = L )
12113adant1 1046 . . . 4 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( 2nd ` <. F , L >. ) = L )
1310, 12sylan9eqr 2293 . . 3 |- ( ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) /\ ( s = S /\ b = <. F , L >. ) ) -> ( 2nd ` b ) = L )
14 simp2 1029 . . . . . 6 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( 1st ` b ) = F )
15 simp3 1030 . . . . . 6 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( 2nd ` b ) = L )
1614, 15oveq12d 6106 . . . . 5 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( ( 1st ` b )..^ ( 2nd ` b ) ) = ( F..^ L ) )
17 simp1 1028 . . . . . 6 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> s = S )
1817dmeqd 4985 . . . . 5 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> dom s = dom S )
1916, 18sseq12d 3279 . . . 4 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( ( ( 1st ` b )..^ ( 2nd ` b ) ) C_ dom s <-> ( F..^ L ) C_ dom S ) )
2015, 14oveq12d 6106 . . . . . 6 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( ( 2nd ` b ) - ( 1st ` b ) ) = ( L - F ) )
2120oveq2d 6104 . . . . 5 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) = ( 0..^ ( L - F ) ) )
2214oveq2d 6104 . . . . . 6 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( x + ( 1st ` b ) ) = ( x + F ) )
2317, 22fveq12d 5705 . . . . 5 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( s ` ( x + ( 1st ` b ) ) ) = ( S ` ( x + F ) ) )
2421, 23mpteq12dv 4214 . . . 4 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> ( x e. ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) |-> ( s ` ( x + ( 1st ` b ) ) ) ) = ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) )
2519, 24ifbieq1d 3663 . . 3 |- ( ( s = S /\ ( 1st ` b ) = F /\ ( 2nd ` b ) = L ) -> if ( ( ( 1st ` b )..^ ( 2nd ` b ) ) C_ dom s , ( x e. ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) |-> ( s ` ( x + ( 1st ` b ) ) ) ) , (/) ) = if ( ( F..^ L ) C_ dom S , ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) , (/) ) )
263, 8, 13, 25syl3anc 1278 . 2 |- ( ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) /\ ( s = S /\ b = <. F , L >. ) ) -> if ( ( ( 1st ` b )..^ ( 2nd ` b ) ) C_ dom s , ( x e. ( 0..^ ( ( 2nd ` b ) - ( 1st ` b ) ) ) |-> ( s ` ( x + ( 1st ` b ) ) ) ) , (/) ) = if ( ( F..^ L ) C_ dom S , ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) , (/) ) )
27 elex 2833 . . 3 |- ( S e. V -> S e. _V )
28273ad2ant1 1049 . 2 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> S e. _V )
29 opelxpi 4808 . . 3 |- ( ( F e. ZZ /\ L e. ZZ ) -> <. F , L >. e. ( ZZ X. ZZ ) )
30293adant1 1046 . 2 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> <. F , L >. e. ( ZZ X. ZZ ) )
31 0zd 9667 . . . . 5 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> 0 e. ZZ )
32 simp3 1030 . . . . . 6 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> L e. ZZ )
33 simp2 1029 . . . . . 6 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> F e. ZZ )
3432, 33zsubcld 9784 . . . . 5 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( L - F ) e. ZZ )
35 fzofig 10890 . . . . 5 |- ( ( 0 e. ZZ /\ ( L - F ) e. ZZ ) -> ( 0..^ ( L - F ) ) e. Fin )
3631, 34, 35syl2anc 415 . . . 4 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( 0..^ ( L - F ) ) e. Fin )
3736mptexd 5947 . . 3 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) e. _V )
38 0ex 4262 . . . 4 |- (/) e. _V
3938a1i 9 . . 3 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> (/) e. _V )
4037, 39ifexd 4632 . 2 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> if ( ( F..^ L ) C_ dom S , ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) , (/) ) e. _V )
412, 26, 28, 30, 40ovmpod 6219 1 |- ( ( S e. V /\ F e. ZZ /\ L e. ZZ ) -> ( S substr <. F , L >. ) = if ( ( F..^ L ) C_ dom S , ( x e. ( 0..^ ( L - F ) ) |-> ( S ` ( x + F ) ) ) , (/) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   (/)c0 3520   ifcif 3638   <.cop 3712   |-> cmpt 4193   X. cxp 4774   dom cdm 4776   ` cfv 5380  (class class class)co 6088   e. cmpo 6090   1stc1st 6376   2ndc2nd 6377   Fincfn 7026   0cc0 8185   + caddc 8188   - cmin 8504   ZZcz 9655  ..^cfzo 10566   substr csubstr 11439
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-er 6811  df-en 7027  df-fin 7029  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656  df-uz 9938  df-fz 10429  df-fzo 10567  df-substr 11440
This theorem is used by:  swrd00g  11443  swrdclg  11444  swrdval2  11445  swrdlend  11452  swrdnd  11453  swrd0g  11454  pfxval  11468  fnpfx  11471
  Copyright terms: Public domain W3C validator