import ContractExact namespace Submission open ExactRuntime FloatLib.Floats.Formats.BinaryInterchange FloatLib.Floats open USize renaming lt_iff_toNat_lt->β,le_size->ε,toNat_zero->ρ,le_iff_toNat_le->Α,toNat_one->ϔ,toNat_add->Ϝ,toNat_sub_of_le->Ϸ open Nat renaming and_two_pow_sub_one_eq_mod->γ,shiftRight_eq_div_pow->δ,mul_le_mul_right->ζ,mod_eq_of_lt->ι,shiftLeft_eq->χ,add_one_mul->Β,pow_le_pow_right->Η,succ_mul->Θ,two_pow_add_eq_or_of_lt->ϊ,add_zero->ό,le_mul_of_pos_left->ώ,mul_assoc->ϐ,testBit_eq_decide_div_mod_eq->ϕ,zero_mul->ϖ,add_mul->ϗ,and_le_right->Ϙ,le_add_right->Ϛ,mul_lt_mul_of_pos_right->ϡ,mul_one->ϣ,mul_le_mul->Ϥ,mul_comm->Ϩ,zero_add->ϩ,zero_le->ϱ,mod_lt->ϸ,lt_log2_self->Ϻ open UInt32 renaming toNat_inj->η,lt_iff_toNat_lt->ν,toNat_and->ξ,le_iff_toNat_le->Ζ,toNat_shiftRight->Ι,toNat_zero->ϋ,toNat_sub->ϑ,toNat_or->ϓ,toNat_toUInt64->Ϟ,toNat_shiftLeft->ϲ,toNat_sub_of_le->ϵ,toNat_add->Ϲ open UInt64 renaming lt_iff_toNat_lt->θ,toNat_inj->κ,toNat_add->μ,toNat_and->ο,le_iff_toNat_le->τ,toNat_shiftLeft->υ,toNat_shiftRight->ψ,toNat_ofNat_of_lt'->Ε,toNat_sub_of_le->Κ,toNat_toUInt32->Ν,toNat_sub->Τ,toNat_lt->ϭ open Bool renaming false_eq_true->ς,and_eq_true->Μ,eq_iff_iff->ϛ,false_ne_true->ϰ open Finset renaming sum_range_succ->Λ,sum_congr->ϧ open Array renaming getElem_ofFn->Ξ,size_uset->Ρ,size_replicate->ύ,uset_eq_set->Ϡ,getElem?_eq_getElem->Ϫ,getElem!_set!_self->Ϭ,getElem?_eq_none->ϳ,getElem!_set!_ne->ϴ open Model renaming toModel_ofFloatModel->Ο,isFinite_roundDyadic_of_isIEEE_of_abs_toReal_le_posMaxFinite->Χ,toReal_roundDyadic_eq_roundAt->Ϗ,abs_signed_mul_bpow_le_toReal_posMaxFinite->ϒ,unpack_pack_notANumber->ϝ,roundDyadicGeneral_eq_roundDyadic->Ϣ,isNaN_eq_false_of_toDyadic?_some->ϥ,unpack_pack_infinity->Ϧ,toDyadic?_ofFields_of_isFinite->ϫ,roundDyadic_of_representable->Ϯ,roundAt_mono->ϯ open FloatLib.Numerics.Dyadic renaming cast_toRat->Υ open Int renaming natAbs_mul->ϙ,abs_eq_natAbs->ϟ open FloatLib.Floats.ExecFloat.Binary renaming toModel_ofFloat_int64ToFloat->϶ open Model.Reduction renaming dotWithStatus_eq_round_of_finite_nonzero->ϻ local notation "А" => by omega local notation "Б" => by decide local notation "В" => by positivity local notation "Г" => by norm_num local notation "Д" => UInt64 local notation "Е" => UInt32 local postfix:max "а"=>USize.toNat local postfix:max "б"=>UInt64.toNat local postfix:max "в"=>UInt32.toNat local postfix:max "г"=>Array.size local postfix:max "д"=>Nat.toUSize local postfix:max "е"=>FloatArray.size local postfix:max "ж"=>UInt64.toUInt32 local postfix:max "з"=>Int.natAbs local postfix:max "и"=>Fin.val local postfix:max "й"=>Nat.log2 local postfix:max "к"=>UInt32.toUSize local postfix:max "л"=>UInt32.toUInt64 open USize renaming reduceToNat->jH,size->kl,add_zero->lM open UInt64 renaming reduceToNat->jI,size->j6,ofNat->ki,toNat->kx,toNat_or->kG,toNat_zero->k7,toNat_one->ld,toUInt32->lz,toNat_toBitVec->lF open ExactRuntime renaming Word->jJ,expOf->jL,oneW->jR,idxOf->jS,toDyadic_ofUInt32->jV,toWord->jW,mantOf->jX,signOf->j5,windowAt->j7,ofIntDyadic->ka,finishWord->kb,fracOf->kc,ConvShape->ke,dotOf->ku,finishWord_of_ne->kz,mantOf_lt_24->kL,conv2dSpec->kZ,ofW->k4,isFinite_ofUInt32->k6,avgpoolSpec->la,decodeD->lv,Fmt->lx,avgpoolWith->lP,scaleShiftSpec->lQ,ofUInt32_bits->lX,decodeD_toRat->lZ,act->mc,poolAt->mm open FloatLib.Floats.Formats.BinaryInterchange.FloatFormat renaming binary64->jK open FloatLib.Floats.Formats.BinaryInterchange.Model renaming roundDyadic->jM,ofFloatModel->jP,isNaN_eq_false_of_toDyadic?_some->kj,ofUInt32->kq,unpackedToReal->kC,toReal_add_eq_roundAt->kM,toNatBits_lt_two_pow->kS,ofNatBits_toNatBits->k5,ofFloatModel_pack->lg,isFinite_ofFields->lh,toReal->lr,toReal_eq->lB,pow2_eq_two_pow->lG,isFinite->lI,ofFloat32Model->lL,add->lR,roundAt->lY,maximum->l2,posMaxFinite->l4,modelSignBit->l5,pow2->mv open UInt32 renaming reduceToNat->jN,toNat_ofNat'->kK,toNat->kN,lt_asymm->lD,ne_of_lt->lE open Nat renaming reduceMod->jO,reduceAdd->jY,reduceDiv->kB,log2->kD,and_two_pow->kH,two_pow_pos->kI,left_le_or->kT,eq_zero_or_pos->kX,one_mul->k9,add_assoc->lb,mul_lt_mul''->lf,div_div_eq_div_mul->lq,sub_zero->lw,toUInt64_eq->lC,le_log2->lJ,cast_ofNat->lK,mul_pos->lN,log2_eq_log_two->lS,mul_le_mul_left->lV,cast_one->md open FloatLib.Numerics renaming Dyadic->jQ,shiftRightJam->kd,binaryRadix->km,roundQuotientEven->kr,roundShiftRightEven_shiftRightJam->kt open Float.Model.UnpackedFloat renaming mul->jT,unpack->jU,isFinite->jZ,add->kF,unpackExponent->lH,Sign->mi,pack->mj open Array renaming emptyWithCapacity->j2,ofFn->kn,set!_eq_setIfInBounds->kO,ext->li,size_ofFn->ly,getElem?_ofFn->lT,setIfInBounds->lU,ext_getElem?->l9,getElem_set->me open Finset renaming range->j3 open Float.Model.Format renaming binary64->j4,binary32->j9 open FloatLib.Numerics.Dyadic renaming ofScaledInt->j8,cast_signedSignificand->k8,toRat_eq_zero_iff->ll,signedSignificand->lm,ofScaledInt_toRat->ls,add_toRat->l6,mul_toRat->l7,toReal->mf,toRat->mg open FloatLib.Numerics.FixedWord renaming roundShiftRightEven->kg open FloatLib.Numerics.RationalBinary renaming floorLog2->kp,scaleByPowerOfTwo_ofNat->kE,lessThanPowerOfTwo->kQ,atLeastPowerOfTwo->k3 open System.Platform renaming numBits->ks,numBits_eq->kV open Float.Model renaming pack->kA,unpack->ma,add->mq,mul->ms open FloatArray renaming size->kJ,uget->lA open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Semantics renaming finiteDot_toList_eq_slice->kP open BitVec renaming toInt_eq_toNat_cond->kR open Float32 renaming ofBits->kU open FloatLib.Floats.Formats.BinaryInterchange.Model.Reduction.Internal renaming dotState_exact_toRat->lc,dotState->mb open FloatLib.Floats.Formats.BinaryInterchange.Model.Proof renaming div_eq_spec->lj open FloatLib.Floats.Formats.BinaryInterchange.Model.NativeBinary32 renaming ofUInt32_roundRatScaled->lk,toUInt32_ofFields->lO,roundRatScaled->l3,toUInt32->mn open Int renaming cast_abs->lu open FloatLib.Floats.Formats.BinaryInterchange.Model.Spec renaming div->mu local notation "м"=>Nat local notation "н"=>USize local notation "о"=>Array local notation "п"=>Word local notation "р"=>Float local notation "с"=>Int local notation "т"=>Bool local notation "у"=>Prop open _root_ renaming zpow_natCast->AA,ite_eq_right->AB,ite_eq_left->AD,mul_le_mul_of_nonneg_right->AE,getElem!_pos->AF,zpow_le_zpow_right₀->AG,two_ne_zero->AH,dite_eq_right->AI,le_rfl->AJ,dite_eq_left->AL,pow_add->AM,pow_le_pow_right₀->AN,decide_eq_true_eq->AO,ite_false->AP,zpow_add₀->AQ,lt_of_le_of_lt->AR,bne_iff_ne->AS,beq_iff_eq->AT,lt_irrefl->AU,decide_eq_true->AX,ite_true->AY,mul_lt_mul_of_pos_right->AZ,lt_of_lt_of_le->Ac,two_pos->Ae,zpow_sub₀->Af,apply_ite->Ag,abs_of_pos->Ah,mul_ne_zero->Aj,one_mul->Am,ne_eq->An,zpow_pos->Ao,mul_nonneg->Ap,mul_assoc->Au,decide_false->Av open USize renaming reduceToNat->AC,size->AW open Array renaming replicate->AK,ofFn->Aa,emptyWithCapacity->Al,size_set!->A7 open Model renaming div->AV,fma->Ak,ofFloatModel->As open Nat renaming lt_of_lt_of_le->Ad,mod_le->Ai,mul_zero->Aq,log2->Ar,pos_of_ne_zero->Ay,div_mod_unique->Az,and_one_is_mod->A0,add_sub_cancel->A1,zero_lt_of_lt->A5,one_shiftLeft->A6 open UInt32 renaming zero_and->Aw,ofBitVec->Ax open Float32 renaming ofBits->A2 open ConvShape renaming wo->A3,ho->A4 local notation "Ж"=>4294967296 section open FloatLib.Numerics lemma aP (s:т) (m:м) (e:с) (j:м) (h:j+25<= mй): jM lx ⟨s,kd m j,e+j⟩=jM lx ⟨s,m,e⟩:=by have g:m≠0:=by rintro rfl;simp at h have o:2^mй<= m:=Nat.log2_self_le g;have u:2^(j+1)<= m:=le_trans (Η Г А) o;have b:(kd m j)й=mй-j:=log2_shiftRightJam m j u have t:kd m j≠0:= shiftRightJam_ne_zero m j (le_trans (Η Г А) u) rw[<- Ϣ,<- Ϣ];unfold Model.roundDyadicGeneral;simp only[t,g,AT,AP,b];have q:((mй-j:м):с)+(e+j)=(mй:с)+e:=А;rw[q];have r:Fmt.fracWidth=23:=rfl;have p:Fmt.minSubnormalExponent=-149:=rfl;have l:Fmt.minNormalExponent=-126:=rfl;rw[r,p,l];split_ifs with h1 h2 h3 h4<;>try omega .rfl .congr 1 obtain ⟨a,v⟩:∃a:м,e- -149=Int.negSucc a:=⟨(-(e+149)-1).toNat,А⟩ have w:e+j- -149=Int.negSucc (a-j):=А;rw[v,w];dsimp only;rw[(А:a-j+1=(a+1)-j)] exact kt m j (a+1) А .congr 1 rw[(А:mй-j-23=(mй-23)-j)] exact kt m j _ А end lemma ar (n:м) (f:м-> Е) (k:м) (b:kf iи)[k]! =f k:=by rw[AF _ k (by simpa using b),Ξ] namespace Core def tm (a b:п):с:=sv a*sv b*2^(idxOf a+idxOf b) def ah (n:м) (fa fb:м-> п):с:=∑k∈Finset.range n,tm (fa k) (fb k) def ao (n:м) (fa fb:м-> п):у:=∀k,k expOf (fa k)≠255/\expOf (fb k)≠255 lemma aw (n:м) (b e:м-> jJ): ah (n+1) b e=ah n b e+tm (b n) (e n):=Λ _ _ lemma bU (n:м) (m o:м-> jJ) (l:ao n m o): ku n m o=kb (ah n m o) (-298) (decide (n≠0)&& dallNZ (kn (n:=n) λi=>m iи) (kn (n:=n) λi=>o iи) 0 n):=by unfold ku dotSpec Model.dot;set A:=kn (n:=n) λi=>m iи set B:=kn (n:=n) λi=>o iи set L:=A.map (kq (fmt:=lx));set R:=B.map (kq (fmt:=lx));have j:Lг=Rг:=by simp[L,R,A,B] have e:∀k (h:kby simp[L,A,k6] at h⊢;exact (l k h).1 have g:∀k (h:kby simp[R,B,k6] at h⊢;exact (l k h).2 have p:∀k,0<= k-> k<0+Lг-> jL A[k]!≠255/\jL B[k]!≠255:=λk _ h=>by simp[L,A] at h;simp only[A,B,ar n _ k h];exact l k h have v:∀i c,dsum A B i c=∑k∈j3 c,tm A[i+k]! B[i+k]!:=λi c=>by induction c generalizing i with | zero=>simp[dsum] | succ c w=> rw[dsum,w (i+1),Finset.sum_range_succ',add_comm];exact congrArg₂ _ (ϧ rfl λk _=>by rw[(А:i+1+k=i+(k+1))]) rfl have b:=(finiteDotSlice_eq A B 0 Lг (by simp[L]) (by simp[j,R]) p).trans (c:=(ah n m o:ℚ)*2^(-298:ℤ)) (by simp only[v,ah,L,A,B,Array.size_map,ly];congr 2;exact ϧ rfl λk p=>by simp at p;simp[ar n _ k p]) have r:=lc (destination:=lx) L R j e g;by_cases q:ah n m o=0 .rw[q,finishWord_zero,Model.Reduction.dotWithStatus_eq_zero_of_finite lx L R .nearestEven j e g ((ll _).1 (by rw[r,b,q];simp))] obtain ⟨t,u⟩:=dotStateLoop_flags A B {} 0 Lг (by simp[L]) (by simp[j,R]) p unfold mb;rw[t,u];simp[L,A];rfl .rw[ϻ lx L R .nearestEven j e g (by rw[kP L R j,Ne,Except.ok.injEq,b];simpa)] exact (kz _ (ah n m o) (-298) _ q (by rw[r,b])).symm lemma aq (n:м) (b e:м-> jJ) (g:ao n b e) (h:ah n b e≠0): ku n b e=kb (ah n b e) (-298) false:=by simp[bU n b e g,kb,h] @[inline] def fe (w:Е):Д:=if (w>>>23)&&&255!=0 then 1 else 0 @[inline] def mW (w:Е):Д:=(w&&&8388607)л ||| (fe w<<<23) @[inline] def iW (w:Е):Д:=((w>>>23)&&&255)л-fe w def cA (x:Д):с:=x.toBitVec.toInt lemma aI (w:Е):(mW w)б=jX w:=by have e:(w&&&8388607)в<2^23:=by rw[ξ];exact AR Ϙ Б unfold mW fe jX jL kc;by_cases b:(w>>>23)&&&255=0 .simp[b] .simp only[show ((w>>>23)&&&255!=0)=true by simpa using b,b,AY,AP] rw[kG,Ϟ,show ((1:Д)<<<23)б=2^23*1 from rfl,Nat.or_comm, <- ϊ e,ϣ,Nat.add_comm] lemma cu (w:Е):(iW w)б=jS w:=by unfold iW fe jS jL;have g:=expOf_toNat_lt w;unfold jL at g;by_cases e:(w>>>23)&&&255=0 .simp[e] .have b:1<=((w>>>23)&&&255)в:= Nat.one_le_iff_ne_zero.2 λh=>e (η.mp (by simpa using h)) simp only[show ((w>>>23)&&&255!=0)=true by simpa using e,e,AY,AP] rw[Κ _ _ (τ.mpr (by rw[Ϟ];simpa using b)), Ϟ] rfl lemma ay (w:Е):j5 w=true↔2^31<= wв:=by have:=w.toNat_lt rw[j5,AS,An,<- η,ξ,show (0x80000000:Е)в=2^31 from rfl, kH,ϕ] by_cases h:wв/2^31%2=1<;>simp[h]<;>omega @[inline] def sx (k x:Д):Д:=bif x>>>k==0 then x else x>>>k @[inline] def sr (k x r:Д):Д:=bif x>>>k==0 then r else r+k @[inline] def aY (x0:Д):Д:= let x1:=sx 32 x0 let r1:=sr 32 x0 0 let x2:=sx 16 x1 let r2:=sr 16 x1 r1 let x3:=sx 8 x2 let r3:=sr 8 x2 r2 let x4:=sx 4 x3 let r4:=sr 4 x3 r3 let x5:=sx 2 x4 let r5:=sr 2 x4 r4 sr 1 x5 r5 @[inline] def di (value shift:Д):Д:= let quotient:=value>>>shift let remainder:=value&&&((1<<half then 1 else 0) @[inline] def aU (value shift:Д):Д:= if shift==0 then value else if shift<64 then di value shift else if shift==64 then (if value>0x8000000000000000 then 1 else 0) else 0 @[inline] def cO (sign:т) (e f:Е):Е:= (if sign then (0x80000000:Е) else 0) ||| ((e&&&255)<<<23) ||| (f&&&8388607) @[inline] def c9 (n:Д):Е:= (if n<8388608 then 0 else n-8388608)ж @[inline] def b7 (sign:т) (product scale:Д):Е:= if product==0 then if sign then 0x80000000 else 0 else let leading:=aY product let position:=leading+scale if position<172 then let fraction:= if scale<149 then aU product (149-scale) else product<<<(scale-149) if fraction==0 then (if sign then 0x80000000 else 0) else if fraction==8388608 then cO sign 1 0 else cO sign 0 fractionж else let roundedMantissa:= if leading<23 then product<<<(23-leading) else aU product (leading-23) let carry:=roundedMantissa==16777216 let normalizedPosition:=if carry then position+1 else position if normalizedPosition>425 then (if sign then 0xff800000 else 0x7f800000) else let normalizedMantissa:=if carry then 8388608 else roundedMantissa cO sign (normalizedPosition-171)ж (c9 normalizedMantissa) open Model.NativeBinary32 in lemma dc (n k:м) (h:n>>>k≠0):nй=k+(n>>>k)й:=by rw[δ] at* have:=(lJ (by rintro rfl;simp at h)).2 (Nat.div_pos_iff.1 (Ay h)).2 rw[lS,lS,Nat.log_div_base_pow] at*;omega lemma bO (e r x k:Д) (o:kб<=32) (l:0simp[h,Nat.log2_lt,e.toNat_lt] have g:kб%64=kб:=ι А;unfold sx sr;by_cases j:x>>>k=0<;>simp[j,g,b] .simpa[g,δ,Nat.div_eq_zero_iff] using congrArg kx j have:=dc xб kб (by simpa[<- κ,g] using j) refine ⟨А,?_⟩ rw[δ];exact Nat.div_lt_of_lt_mul (by rwa[<- Nat.pow_add,(А:kб+kб=2*kб)]) lemma bq (x:Д):aY x=x.log2:=by apply κ.mp;obtain ⟨o,e⟩:=bO x 0 x 32 Б Б (by simp) x.toNat_lt obtain ⟨p,g⟩:=bO x _ _ 16 Б Б o e;obtain ⟨q,h⟩:=bO x _ _ 8 Б Б p g;obtain ⟨r,j⟩:=bO x _ _ 4 Б Б q h;obtain ⟨t,l⟩:=bO x _ _ 2 Б Б r j;obtain ⟨b,m⟩:=bO x _ _ 1 Б Б t l;rw[Nat.log2_def (sx 1 _)б,AB (by simpa using m)] at b unfold aY;exact b.symm lemma dU (g e:Д): aU g e=kg g eб:=by unfold aU kg;by_cases h:e=0 .subst h;rfl have:=e.toNat_lt;have j:eб≠0:=by simpa[<- κ] using h simp only[h,j,AT,UInt64.ofNat_toNat,θ,↓reduceIte, show ki (eб-1)=e-1 from κ.mp (by simp[Τ];omega), show e=64↔eб=64 by rw[<- κ];rfl] refine ite_congr rfl (λl=>?_) λ_=>rfl have:(g&&&((1<<simp[τ, ι l,A6,ι (by omega:2^e.toNat<0x10000000000000000),Nat.one_le_two_pow] exact (ϸ _ (kI _)).trans_le m have:((g>>>e)&&&1)б<=1:=by simp[ο];omega have:=(g>>>e).toNat_lt simp only[di,gt_iff_lt,θ,μ,AT,<- κ, Ag kx,ld,jI] generalize (g&&&((1<<>>e)&&&1)б=b at* split_ifs<;>omega lemma ct (n:Д):c9 n=UInt32.ofNat (nб-8388608):=by unfold c9;split<;>simp_all[lz,Nat.toUInt32,θ,Κ,τ,Nat.sub_eq_zero_of_le,le_of_lt] open Model.NativeBinary32 in lemma bb (w:Е):jW (ofUInt32 w)=w:=by conv_rhs=>rw[<- toUInt32_ofUInt32 w] exact η.mp (ι (BitVec.isLt _)) open Model.NativeBinary32 in lemma aJ (e:т) (m b:Д) (g:bб<=506): b7 e m b=jW (jM lx ⟨e,mб,(bб:с)-298⟩):=by erw[<- ofUInt32_roundDyadic,bb,<- roundProduct_eq_roundDyadic _ _ _ g];unfold b7 roundProduct cO mkBits;simp only[bq,dU,ct,lz,Nat.toUInt32];rfl def aK (hi lo:Д):с:=cA hi*2^64+loб @[inline] def ck (hi lo:Д):Д:=if hi>>>63!=0 then (0:Д)-lo else lo @[inline] def ci (hi lo:Д):Д:= if hi>>>63!=0 then (if lo==0 then (0:Д)-hi else ~~~hi) else hi lemma bL (b:Д):(b>>>63!=0)=decide (2^63<= bб):=by have:=b.toNat_lt;rw[ϛ];simp[<- κ,δ] lemma bj (b e:Д): aK b e=(bб*2^64+eб:с)-(if 2^63<= bб then 2^128 else 0):=by unfold aK cA;rw[kR,lF];omega lemma ej (b e:Д): (aK b e)з=(ci b e)б*2^64+(ck b e)б /\ decide (aK b e<0)=(b>>>63!=0):=by have:=b.toNat_lt;have:=e.toNat_lt;unfold ci ck;rw[bj,bL];by_cases g:2^63<= bб<;>simp only[g,decide_true,Av,AY,AP,ς] .split<;>simp_all[j6,UInt64.toNat_not,<- κ]<;>omega .simp;omega @[inline] def bz (hi lo B:Д):Д:= if hi==0&&lo==0 then Ж else if B>442 then Ж else let neg:=hi>>>63!=0 let mlo:=ck hi lo let mhi:=ci hi lo if mhi==0 then (b7 neg mlo B)л else if mhi>>>32==0 then let q:=(mhi<<<32)+(mlo>>>32) (b7 neg (if mlo&&&0xFFFFFFFF==0 then q else q ||| 1) (B+32))л else (b7 neg (if mlo==0 then mhi else mhi ||| 1) (B+64))л lemma bu (n:м) (m o:м-> jJ) (e g B:Д) (q:ao n m o) (j:ah n m o=aK e g*2^Bб) (h:bz e g B<Ж):ku n m o=(bz e g B)ж:=by obtain ⟨r,t⟩:=ej e g;have:=g.toNat_lt;have:=e.toNat_lt;simp only[bz] at h⊢;have w:¬(e==0&&g==0)=true:=λc=>by simp[c] at h have u:¬B>442:=λc=>by simp[c] at h simp only[w,u,ς,↓reduceIte];clear h have v:ah n m o≠0:=by rw[j];refine Aj (λp=>w ?_) В rw[bj] at p;simp only[Μ,AT,<- κ,k7];split at p<;>omega rw[aq n m o q v,kz (ka (aK e g) ((Bб:с)-298)) _ _ _ v (by rw[toRat_ofIntDyadic,j];push_cast;rw[Af AH,AA];field_simp),ka,t,r] symm;simp only[Ag lz,UInt32.toUInt32_toUInt64];generalize ci e g=l at* generalize ck e g=b at* have:=b.toNat_lt;simp only[θ,gt_iff_lt,jI,not_lt] at u;split<;>rename_i p<;>simp only[AT,<- κ,k7] at p .simp[p,aJ _ _ B А] split<;>rename_i z<;>simp[<- κ,δ] at z .rw[aJ _ _ _ (by simp[μ];omega),<- aP _ (lб*2^64+bб) _ 32 ((lJ А).2 А)] congr 3 swap;. simp[μ];omega have x:(lб*2^64+bб)/2^32=(l<<<32+b>>>32)б:=by simp[χ,δ];omega have y:(lб*2^64+bб)%2^32=(b&&&4294967295)б:=by rw[ο,show (4294967295:Д)б=2^32-1 from rfl,γ];omega simp only[kd,jI,x,y,Ag kx,kG,AT, <- κ] .rw[aJ _ _ _ (by simp[μ];omega),<- aP _ (lб*2^64+bб) _ 64 ((lJ А).2 А)] congr 3 swap;. simp[μ];omega simp only[kd,jI,(А:(lб*2^64+bб)/2^64=lб),(А:(lб*2^64+bб)%2^64=bб),Ag kx,kG,AT, <- κ] @[inline] def ap (N:Д):Д:=(N+(0x3FFFFFFFFF:Д)+((N>>>39)&&&1))>>>39 lemma ft (n:т) (e f:Е): (cO n e f)в=(if n then 2^31 else 0)+eв%2^8*2^23+fв%2^23:=by have b:=ϸ fв (kI 23);have:=ϸ eв (kI 8) have g:((e&&&255)<<<23 ||| (f&&&8388607))в=2^23*(eв%2^8)+fв%2^23:=by rw[ϓ,ϲ,ξ,ξ,show (255:Е)в=2^8-1 from rfl, show (8388607:Е)в=2^23-1 from rfl,γ, γ,show (23:Е)в%32=23 from rfl,χ,Ϩ,ι (by simp;omega), <- ϊ b] unfold cO;rw[UInt32.or_assoc];cases n<;>simp only[ς,↓reduceIte,UInt32.zero_or,ϓ,g] .omega .rw[show (0x80000000:Е)в=2^31*1 from rfl,<- ϊ А];omega lemma bg (n:т) (N g:Д) (l:2^62<= Nб) (m:Nб<2^63) (t:110<= gб) (j:gб<363): (b7 n N g)в=(if n then 2^31 else 0)+((gб-110)*2^23+(ap N)б) /\ 2^23<=(ap N)б/\(ap N)б<=2^24:=by have o:(N>>>39)б=Nб/2^39:=by simp[δ] have e:((N>>>39)&&&1)б=Nб/2^39%2:=by simp[o,A0] have r:(ap N)б=Nб/2^39+if 2^38omega have h:2^23<= Nб/2^39/\Nб/2^39<2^24:=by clear*-l m;omega have b:(aU N (62-23))б=(ap N)б/\2^23<=(ap N)б/\(ap N)б<=2^24:=by have p:(N&&&0x7FFFFFFFFF)б=Nб%2^39:=by rw[ο];exact γ _ 39 rw[r];show (di N 39)б=_/\_;unfold di simp only[show ((1:Д)<<<39)-1=0x7FFFFFFFFF from rfl,show (1:Д)<<<(39-1)=0x4000000000 from rfl,gt_iff_lt,θ,μ,p,e,o,Ag kx,jI] clear*-h;split_ifs<;>omega refine ⟨?_,b.2⟩;unfold b7 simp only[show aY N=62 by rw[bq,<- κ];exact (Nat.log2_eq_iff (by omega:N.toNat≠0)).2 ⟨l,m⟩, show (N==0)=false by simp[<- κ];omega,show ¬62+g<172 by simp[θ];omega, show ¬(62:Д)<23 by decide,AP,ς] obtain ⟨b,e⟩:=b;generalize aU N (62-23)=R at b⊢;rw[<- b] at e⊢;clear*-e t j;by_cases q:Rб=16777216<;>simp[q,<- κ,ct,θ]<;>split<;>(try omega)<;>simp[ft,ϑ,Ϲ]<;>omega lemma gG (n:т) (M σ:Д) (e:Mб≠0) (b:σб<=506): b7 n M σ=kb ((if n then-(Mб:с) else Mб)*2^σб) (-298) false:=by rw[aJ _ _ _ b];refine (kz _ _ _ _ (Aj (by split<;>omega) В) ?_).symm cases n<;>simp[mg,lm,Af]<;>field_simp end Core open Core lemma dl (w:jJ):jW (k4 w)=w:=by apply η.mp;simp only[jW,k4,Model.toNatBits,lX,kK];exact ι w.toBitVec.isLt lemma aF (z:Model lx):k4 (jW z)=z:=by have h:z.toNatBits<2^32:=kS z;simp only[k4,jW,kq,kK,ι h];exact k5 z namespace Dense lemma ae {k n:н} (h:ksplit<;>push_cast<;>omega @[inline] def au (x:Е):Е:=x&&&0x7FFFFFFF lemma aQ (x:Е):(au x)в=xв%2^31:=by unfold au;rw[ξ];exact γ _ 31 lemma aR (x:Е):(jL x)в=(au x)в/2^23:=by have:(jL x)в=xв/2^23%2^8:=by unfold jL;rw[ξ,Ι];simp only[jN,jO,δ];exact γ _ 8 rw[this,aQ,show 2^31=2^23*2^8 by norm_num,Nat.mod_mul_right_div_self] lemma ee (x:Е):jL x=0↔(au x)в<2^23:=by rw[<- η,aR];simp;try omega lemma i5 (x:Е):jS x=(au x)в/2^23-1:=by have:=aR x;unfold jS;split<;>rename_i h .have:=(ee x).mp h;omega .have:=mt (ee x).mpr h;omega lemma aS (x:Е):jS x=(jL x)в-1:=by rw[i5,aR] lemma bS (w:Е):wв/2^23=(jL w)в+256*(wв/2^31):=by rw[aR,aQ];have:=w.toNat_lt;omega lemma ax (x:Е):(jL x)в<256:=by rw[aR,aQ];omega lemma ei (w:Е):(w&&&8388607)в=wв%2^23:=by rw[ξ];exact γ _ 23 lemma cz (w:Е): |sv w| <2^24:=by have:=kL w;unfold sv;split<;>simp<;>omega lemma bQ {k:н} {a:о Е} (h:k>>1>>>(63-s))+(if l'simp only[jI]<;>omega @[specialize] def iX (fa fb:м-> п) (n t:м) (B:Д):Д:= if t п) (n:м) (B:Д) (t:м) (pH pL nH nL:Д):Д:= if tsplit<;>push_cast<;>omega lemma eB (b g:м-> jJ) (n:м) (B:Д) (hn:n<2^18): ∀k t (v w r u:Д),n-t=k-> t<= n-> ao t b g -> vб*2^64+wб<= t*2^108-> rб*2^64+uб<= t*2^108 -> ah t b g=(((vб*2^64+wб:м):с)-((rб*2^64+uб:м):с))* 2^Bб -> cG b g n B t v w r u<Ж-> ku n b g=(cG b g n B t v w r u)ж:=by intro k;induction k<;>intro t v w r u hk ht Y K J M j .obtain rfl:t=n:=А rw[cG,AB А] at j⊢;exact bu _ _ _ _ _ _ Y (by rw[M,jG _ _ _ _ А А]) j rename_i k X;have V:t(Nat.lt_succ_iff_lt_or_eq.mp E).elim (Y s) λe=>e ▸ ⟨G,I⟩ have o:jX (b t)*jX (g t)<2^48:= (lf (kL _) (kL _)).trans_eq Г have R:(mW (b t)*mW (g t))б=jX (b t)*jX (g t):=by rw[UInt64.toNat_mul,aI,aI,ι (o.trans Г)] have D:=aw t b g;have m:=ζ (2^108) t.le_succ;split at j .rename_i F rw[AD F];have N:jX (b t)*jX (g t)=0:=by rw[<- R,beq_iff_eq.mp F];rfl refine X (t+1) v w r u y z x (K.trans m) (J.trans m) ?_ j;rw[D,M,add_eq_left];unfold tm sv;rcases Nat.mul_eq_zero.mp N with h | h<;>simp[h] rename_i F;rw[AB F];obtain ⟨Z,O⟩:=hw λh=>F (by simp[h]) have as:=idxOf_le _ G;have a0:=idxOf_le _ I have Q:(iW (b t)+iW (g t))б=jS (b t)+jS (g t):=by rw[μ,cu,cu,ι А] rw[Q] at Z have E:(iW (b t)+iW (g t)-B)б=jS (b t)+jS (g t)-Bб:=by rw[Κ _ _ (by rw[τ,Q];omega),Q] rw[E] at O have U:(2:с)^(jS (b t)+jS (g t))=2^(jS (b t)+jS (g t)-Bб)*2^Bб:=by rw[<- AM];congr 1;omega generalize l:(jX (b t)*jX (g t))*2^(jS (b t)+jS (g t)-Bб)=T have p:T<=2^108:= l ▸ (Ϥ o.le (Η Г (by omega:_<=60))).trans_eq Г have A:tm (b t) (g t)=(if j5 (b t)==j5 (g t) then (T:с) else-T)*2^Bб:=by rw[<- l];unfold tm sv;rw[U];cases j5 (b t)<;>cases j5 (g t)<;>simp<;>ring have S:=λH L (af:Hб*2^64+Lб<= t*2^108)=>ez H L _ _ (by rw[E];omega) (by rw[R,E,l];omega) rw[R,E,l] at S;cases hg:(j5 (b t)==j5 (g t))<;>simp only[hg,AY,AP,ς] at A j⊢ .have q:=S r u J refine X (t+1) v w _ _ y z x (K.trans m) (by rw[q];exact Θ t _ ▸ Nat.add_le_add J p) ?_ j rw[D,M,q,A];push_cast;ring .have q:=S v w K refine X (t+1) _ _ r u y z x (by rw[q];exact Θ t _ ▸ Nat.add_le_add K p) (J.trans m) ?_ j rw[D,M,q,A];push_cast;ring @[inline] def gZ (n:м) (fa fb:м-> п):п:= let r:=if n<262144 then cG fa fb n (iX fa fb n 0 1023) 0 0 0 0 0 else Ж if r<Ж then rж else dotOf n fa fb lemma bG (n:м) (b e:м-> jJ):gZ n b e=ku n b e:=by unfold gZ;dsimp only;by_cases g:n<262144 .rw[AD g];split .exact (eB b e n _ А _ 0 0 0 0 0 rfl А (λ_ h=>absurd h А) (by simp) (by simp) (by simp[ah]) ‹_›).symm .rfl .rw[AB g,AB Б] namespace F noncomputable def rv (v:р):ℝ:=Model.toReal (As v.toModel) def fv (v:р):у:=Model.isFinite (As v.toModel)=true lemma iQ (v:р):rv v=kC v.toModel.unpack:=by unfold rv;rw[Model.toReal_eq_unpackedToReal_toModel Б,Ο] lemma bA (v:р):fv v↔v.toModel.unpack.isFinite=true:=by unfold fv;rw[<- Model.toDyadic?_isSome_eq_isFinite,Model.toDyadic?_ieee_eq_model _ Б,Ο];cases v.toModel.unpack<;>rfl lemma fR (x y:р) (b:fv x) (e:fv y): jP (x+y).toModel=lR (jP x.toModel) (jP y.toModel):=by change jP (mq x.toModel y.toModel)=_;rw[mq,lg] have h:=Model.add_eq_ofModel_add_of_isFinite (fmt:=jK) Б (jP x.toModel) (jP y.toModel) (by rw[Ο];exact (bA x).1 b) (by rw[Ο];exact (bA y).1 e) rw[Ο,Ο] at h;exact h.symm lemma pm (E:с) (e:E<=971):(2:ℝ)^E<= lr (l4 jK):=by have b:FloatFormat.binary64.maxNormalExponent-Int.ofNat FloatFormat.binary64.fracWidth=971:=Б have h:=ϒ jK false 1 E Б (by rw[b];exact e) simp only[ς,AP,md,Am] at h;change |(2:ℝ)^E| <= _ at h simpa only[Ah (Ao (by norm_num:(0:ℝ)<2) E)] using h open FloatLib.Floats.Formats.Flocq in lemma re (x:ℝ) (E:с) (g:-1021<= E) (e: |x| <(2:ℝ)^E): |Model.roundAt jK x-x| <= (2:ℝ)^(E-53)/2:=by by_cases b:x=0 .subst x;rw[Model.roundAt_zero];simp only[sub_zero,abs_zero];positivity have h:magnitude km x<= E:=magnitude_le_of_abs_lt_bpow _ x E b e;apply (Model.abs_roundAt_sub_le jK x).trans;apply div_le_div_of_nonneg_right _ Г;change ulp km (Model.fexpOf jK) x<=(2:ℝ)^(E-53);rw[ulp.of_ne_zero _ _ x b];change (2:ℝ)^(max (magnitude km x-53) (-1074))<=(2:ℝ)^(E-53);apply AG Г;omega lemma gm (x y:р) (b:fv x) (e:fv y) (j: |rv x+rv y| <= lr (l4 jK)): fv (x+y)/\rv (x+y)=lY jK (rv x+rv y):=by have h:=fR x y b e have g:=Model.isFinite_add_of_abs_toReal_add_le_posMaxFinite (jP x.toModel) (jP y.toModel) Б b e j refine ⟨by unfold fv;rw[h];exact g,?_⟩ unfold rv;rw[h];exact kM _ _ Б b e g lemma eg (x y:р) (l:fv x) (m:fv y) (E:с) (j:-1021<= E) (b:E<=971) (e: |rv x+rv y| <(2:ℝ)^E): fv (x+y) /\ |rv (x+y)-(rv x+rv y)| <= (2:ℝ)^(E-53)/2:=by obtain ⟨g,h⟩:=gm x y l m (e.le.trans (pm E b));exact ⟨g,by rw[h];exact re _ E j e⟩ lemma rx (d:jQ) (j:d.significand<2^53) (e:-1074<= d.exponent) (b: |d.toReal| <= (2:ℝ)^(971:с)): lY jK d.toReal=d.toReal:=by obtain ⟨g,h⟩:=Ϯ jK Б d d.significand 0 (by simp) j e (b.trans (pm 971 AJ)) rw[<- Ϗ _ Б d g,h] lemma fU (x y:р) (m:fv x) (o:fv y) (d:jQ) (e:d.toReal=rv x+rv y) (l:d.significand<2^53) (j:-1074<= d.exponent) (b: |d.toReal| <= (2:ℝ)^(971:с)): fv (x+y)/\rv (x+y)=rv x+rv y:=by obtain ⟨g,h⟩:=gm x y m o (by rw[<- e];exact b.trans (pm 971 AJ));exact ⟨g,by rw[h,<- e];exact rx d l j b⟩ lemma dH (i:Int64) (e:i.toIntз<2^53):fv i.toFloat/\rv i.toFloat=i.toInt:=by have g:jP i.toFloat.toModel= jM jK (j8 i.toInt 0):= ϶ i have b:(j8 i.toInt 0).toReal=i.toInt:=by rw[<- Υ,ls];simp obtain ⟨h,j⟩:=Ϯ jK Б (j8 i.toInt 0) i.toIntз 0 (ϣ _).symm e (by change _<=(0:ℤ);decide) (by rw[b,<- lu,ϟ];exact le_trans (by exact_mod_cast e.le) (pm 53 Г)) exact ⟨by unfold fv;rw[g];exact h,by unfold rv;rw[g,j,b]⟩ lemma i6 (x y:р):jP (x*y).toModel= Model.ofModel jK (jT j4 x.toModel.unpack y.toModel.unpack):=by change jP (ms x.toModel y.toModel)=_;rw[ms,lg] lemma gS (b:BitVec 64) (s:mi) (m:м) (e:с) (h:0< m) (g:jU j4 b=.finite s m e h): 2^52<= m\/e=-1074:=by revert g;unfold jU;dsimp only;split .split<;>intro g<;>cases g .split .split .intro g;cases g .rename_i o _ intro g;injection g with _ _ l;right;rw[<- l,o];decide .intro g;injection g with _ j _ left;rw[<- j,BitVec.toNat_append];exact le_trans Б kT lemma jp (x y:р) (w:fv x) (z:fv y) (v: |rv x*rv y| <= (2:ℝ)^(971:с)): fv (x*y)/\rv (x*y)=lY jK (rv x*rv y):=by simp only[bA] at w z;rw[iQ x,iQ y] at v⊢;unfold fv rv;rw[i6];generalize A:x.toModel.unpack=X at w v⊢;generalize B:y.toModel.unpack=Y at z v⊢;cases X<;>cases Y<;>simp only[jZ,ς] at w z case finite.finite p j e t q l g u=> have D:=gS _ p j e t A;have E:=gS _ q l g u B have o:e+g<= Float.Model.Format.binary64.targetExponent (Float.Model.totalExponent (j*l) (e+g)):=by change e+g<= max ((kD (j*l):с)+1+(e+g)-53) (-1074);have:=(lJ (n:=j*l) (k:=52) В).2;have:=Nat.le_mul_of_pos_right j u;have:=ώ l t;omega let r:jQ:=⟨xor (l5 p) (l5 q),j*l,e+g⟩ have h:Model.ofModel jK (jT j4 (.finite p j e t) (.finite q l g u))=jM jK r:=by rw[jT,Model.roundWithAccuracy_exact_eq_round_of_le_targetExponent _ _ _ _ o];cases p<;>cases q<;>rfl have b:r.toReal=kC (.finite p j e t)*kC (.finite q l g u):= Model.Dyadic.toReal_mul ⟨_,j,e⟩ ⟨_,l,g⟩ have m:=Χ jK Б r (by rw[b];exact v.trans (pm 971 AJ)) rw[h];exact ⟨m,by rw[Ϗ _ Б r m,b]⟩ all_goals simp[jT,Model.isFinite_ofModel_zero jK Б, Model.toReal_ofModel_zero jK Б] lemma cq (s:т) (m:м) (e:с): (⟨s,m,e⟩:jQ).toReal=(if s then-(m:ℝ) else m)*(2:ℝ)^e:=by simp only[mf,k8];split<;>simp def pw:м-> р | 0=>(1:Int64).toFloat | k+1=>let p:=pw k;p+p lemma gF (k:м) (g:k<=900):fv (pw k)/\rv (pw k)=(2:ℝ)^k:=by induction k with | zero=>have:=dH 1 Б;simp only[pw];exact ⟨this.1,by rw[this.2];simp⟩ | succ k e=> obtain ⟨f,v⟩:=e А have b:(⟨false,1,((k+1:м):с)⟩:jQ).toReal=(2:ℝ)^(k+1):=by rw[cq];simp only[ς,AP,md,Am];exact AA 2 (k+1) have:=fU (pw k) (pw k) f f _ (by rw[b,v,pow_succ];ring) (show (1:м)<2^53 by norm_num) (А:(-1074:с)<=((k+1:м):с)) (by rw[b,Ah В,<- AA];exact AG Г А) simp only[pw];exact ⟨this.1,by rw[this.2,v,pow_succ];ring⟩ def nm:р:=(-1:Int64).toFloat def P:FloatArray:=⟨Aa (n:=512) λi=>if iи<256 then pw (iи-1) else nm*pw (iи-256-1)⟩ lemma fG:Pе=512:=by simp[P,kJ] lemma g6 (i:н) (h:iа>>23)в=wв/2^23:=by rw[Ι];simp[δ] @[inline] def dw (w:Е):р:= (Core.mW w).toInt64.toFloat*P.uget (w>>>23)к (by rw[fG,aT,eu];have:=w.toNat_lt;omega) lemma al (z e:с):(ka z e).toReal=(z:ℝ)*(2:ℝ)^e:=by rw[<- Υ,toRat_ofIntDyadic];push_cast;rfl lemma aZ (x y:р) (o:fv x) (p:fv y) (z e:с) (g:rv x*rv y=(z:ℝ)*(2:ℝ)^e) (m:zз<2^53) (l:-1074<= e) (b: |(z:ℝ)*(2:ℝ)^e| <= (2:ℝ)^(971:с)): fv (x*y)/\rv (x*y)=(z:ℝ)*(2:ℝ)^e:=by obtain ⟨h,j⟩:=jp x y o p (by rw[g];exact b) have:=rx (ka z e) m l (by rw[al];exact b) rw[al] at this;exact ⟨h,by rw[j,g,this]⟩ lemma cy (w:Е):(sv w)з<2^24:=by have:=kL w;unfold sv;split<;>simp<;>omega lemma b0 (a b c:м) (g:a+b<= c) (j:c<=971) (z:с) (h:zз<2^a): |(z:ℝ)*(2:ℝ)^(b:с)| <= (2:ℝ)^(971:с):=by rw[abs_mul,Ah (by positivity:(0:ℝ)<2^(b:с)),AA] have e: |(z:ℝ)| <= 2^a:=by rw[<- lu,ϟ];exact_mod_cast h.le refine (AE e В).trans ?_;rw[<- AM,<- AA];exact AG Г А lemma mV (u:Д) (n:м) (b:uб=n) (e:n<2^25): fv u.toInt64.toFloat/\rv u.toInt64.toFloat=(n:с):=by have:u.toInt64.toInt=n:=by rw[show u.toInt64.toInt=cA u from rfl,fD,b];split<;>omega rw[<- this];exact dH _ (by rw[this];simp;omega) lemma qV (c:м) (A:FloatArray) (o:∀i h,A.uget i h=if iа<256 then pw (iа-c) else nm*pw (iа-256-c)) (w:Е) (h):fv (A.uget (w>>>23)к h) /\ ∃σ:с, (∀v,j5 v=j5 w-> σ*jX v=sv v)/\σз=1 /\ rv (A.uget (w>>>23)к h)=σ*2^((jL w)в-c):=by have:=ax w;have:=w.toNat_lt;have b:=ay w;obtain ⟨j,l⟩:=gF ((jL w)в-c) А;rw[o,aT,eu,bS];split .rw[(А:(jL w)в+256*(wв/2^31)-c=(jL w)в-c)] exact ⟨j,1,λv e=>by simp only[sv,e,b];split<;>omega,rfl,by rw[l];push_cast;ring⟩ .rw[(А:(jL w)в+256*(wв/2^31)-256-c=(jL w)в-c)] have g:=dH (-1) Б obtain ⟨m,p⟩:=aZ _ _ g.1 j (-1) ((jL w)в-c:ℕ) (by rw[g.2,l,AA];rfl) Б А (b0 1 _ 971 А AJ _ Б) exact ⟨m,-1,λv e=>by simp only[sv,e,b];split<;>omega,rfl,by rw[<- AA];exact p⟩ lemma dG (c q:м) (A:FloatArray) (o:∀i h,A.uget i h=if iа<256 then pw (iа-c) else nm*pw (iа-256-c)) (u:Д) (v w:Е) (h) (r:q<=2) (x:uб=q*jX v) (t:j5 v=j5 w) (p:(q:ℝ)*2^((jL w)в-c)=2^jS v): fv (u.toInt64.toFloat*A.uget (w>>>23)к h) /\ rv (u.toInt64.toFloat*A.uget (w>>>23)к h)=(sv v:ℝ)*2^jS v:=by have:=kL v;have:=ζ (jX v) r;have:=ax w;obtain ⟨g,j⟩:=mV u _ x А;obtain ⟨l,σ,b,m,y⟩:=qV c A o w h;have e:(((q*jX v:м):с)*σ)з<2^25:=by rw[ϙ,m];simp;omega have:=aZ _ _ g l _ ((jL w)в-c:м) (by rw[j,y,AA];push_cast;ring) (e.trans Г) А (b0 25 _ 971 А AJ _ e) exact ⟨this.1,by rw[this.2,<- p,AA,<- b v t];push_cast;ring⟩ lemma iG (w:Е) (_:jL w≠255):fv (dw w)/\rv (dw w)=(sv w:ℝ)*2^jS w:= dG 1 1 P g6 _ w w _ А (by simp[aI]) rfl (by simp[aS]) lemma bZ (x w:Е) (j:jL x≠255) (h:jL w≠255): fv (dw x*dw w)/\rv (dw x*dw w)=(tm x w:ℝ):=by obtain ⟨e,l⟩:=iG x j;obtain ⟨g,m⟩:=iG w h have b:(sv x*sv w)з<2^48:=by rw[ϙ];exact (lf (cy x) (cy w)).trans_eq Г have:=aZ _ _ e g (sv x*sv w) (jS x+jS w:м) (by rw[l,m,AA,AM];push_cast;ring) (lt_trans b Г) А (b0 48 _ 971 (by rw[aS,aS];have:=ax x;have:=ax w;omega) AJ _ b) refine ⟨this.1,?_⟩;rw[this.2,tm,AA];push_cast;ring @[inline] def eF (b:Д):Д:=(b>>>52)&&&2047 lemma ja (u:Д):(u&&&0x8000000000000000!=0)=(u>>>63!=0):=by apply ϛ.mpr;simp only[AS,An,<- κ];rw[ο,ψ];change ¬uб&&&2^63=0↔¬uб>>>63=0;rw[kH,δ,ϕ];have b:uб/2^63<2:=by have h:=ϭ u;omega rw[ι b];by_cases e:uб/2^63=1<;>simp<;>omega lemma eU (v:р):jP v.toModel=Model.ofFields jK (v.toBits>>>63!=0) (((v.toBits>>>52)&&&2047)б) ((v.toBits&&&0xfffffffffffff)б):=by rw[<- Model.ofFields_signBit_expField_fracField (jP v.toModel)];congr 1;rw[<- ja];apply ϛ.mpr;simp only[Model.signBit,AS,An];rw[<- UInt64.toBitVec_inj];exact Iff.rfl lemma fq (v:р):((v.toBits>>>52)&&&2047)б<2^11/\(v.toBits&&&0xfffffffffffff)б<2^52:=by simp only[ο];exact ⟨AR Ϙ Б,AR Ϙ Б⟩ lemma eJ (v:р) (e:fv v) (g:¬eF v.toBits=0): rv v=(⟨v.toBits>>>63!=0,(v.toBits&&&0xfffffffffffff)б+2^52, ((eF v.toBits)б:с)-1075⟩:jQ).toReal:=by unfold eF at g⊢;have j:=(fq v).1;have l:=(fq v).2;have b:((v.toBits>>>52)&&&2047)б≠0:=λh=>g (κ.mp (by simpa using h)) unfold fv at e;unfold rv;rw[eU] at e⊢;rw[lB,ϫ _ _ _ _ j l e,AB b] simp only[show FloatFormat.binary64.fracWidth=52 from rfl,show FloatFormat.binary64.exponentBias=1023 from rfl, lG] congr 2<;>(try simp only[Int.ofNat_eq_natCast,lK])<;>ring lemma aF (z:Model lx):k4 (jW z)=z:=by have h:z.toNatBits<2^32:=kS z;simp only[k4,jW,kq,kK,ι h];exact k5 z lemma dk (w:jJ) (b:jL w≠255):lr (k4 w)=(sv w:ℝ)*(2:ℝ)^((jS w:с)-149):=by rw[k4,lB,jV w b];change (lv w).toReal=_;rw[<- Υ,lZ];push_cast;rfl lemma gC (w:jJ) (j:jL w≠255) (m:w&&&0x7FFFFFFF≠0):lr (k4 w)≠0:=by rw[dk w j];refine Aj ?_ (zpow_ne_zero _ Г) have l:jX w≠0:=by unfold jX;split .rename_i b have e:=(ee w).mp b;rw[aQ] at e;have g:(au w)в≠0:=λh=>m (η.mp (h.trans UInt32.toNat_zero.symm)) rw[aQ] at g;unfold kc;rw[ei];omega .omega unfold sv;split<;>simp[l] lemma gL (b g h:jQ) (m:b.toReal<= g.toReal) (o:g.toReal<= h.toReal) (w:jW (jM lx b)=jW (jM lx h)) (u:jL (jW (jM lx b))≠255) (x:jW (jM lx b)&&&0x7FFFFFFF≠0) (v: |g.toReal| <= ((2^24-1:ℕ):ℝ)*(2:ℝ)^(104:с)): jW (jM lx g)=jW (jM lx b):=by have e:=aF (jM lx b);have j:lI (jM lx b)=true:=by rw[<- e,k4,k6];simpa using u have l:=Χ lx Б g (v.trans ((ϒ lx false (2^24-1) 104 Б Б).trans' (by change _<= |(if false=true then (-1:ℝ) else 1)*((2^24-1:ℕ):ℝ)*(2:ℝ)^(104:ℤ)|;norm_num))) have t:jM lx h=jM lx b:=by rw[<- aF (jM lx h),<- w,e] have r:=Ϗ lx Б;have p:=ϯ lx m;have q:=ϯ lx o;rw[<- r b j,<- r g l] at p;rw[<- r g l,<- r h (by rw[t];exact j),t] at q rw[Model.eq_of_toReal_eq_of_nonzero l j (le_antisymm q p) (by rw[le_antisymm q p,<- e];exact gC _ u x)] lemma jv (x:м) (e:x<2^53) (b:x%2^29≠2^28): (ap (ki (x*2^10)))б=(x+2^28)/2^29:=by simp only[ap,ψ,μ,ο,jI, Ε (by simp only[j6];omega:x*2^10ring lemma kW (e:т) (N b:м) (o:2^52<= N) (h:N<2^53) (m:N%2^29≠2^28) (j:1195<= b) (l:b<=1447):(jW (jM lx ⟨e,N*2^10,((b-(1075+10):ℕ):ℤ)-298⟩))в= (if e then 2^31 else 0)+((b-1195)*2^23+(N+2^28)/2^29):=by have n:=Ε (show N*2^10decide .have w:=(bg e 0x7FFFFFE000000000 (ki (b-(1075+11))) Б Б А А).1 rw[w,(Б:(ap 0x7FFFFFE000000000)б=2^24),g];omega lemma uW (e:т) (b:м) (j:1195<= b) (l:b<=1447): (jW (jM lx ⟨e,(2^53+2^26)*2^9,((b-(1075+9):ℕ):ℤ)-298⟩))в= (if e then 2^31 else 0)+(b-1193)*2^23:=by have n:(0x4000000800000000:Д)б=(2^53+2^26)*2^9:=Б have g:(ki (b-(1075+9)))б=b-(1075+9):= Ε (by simp only[j6];omega) rw[<- n,<- g,<- aJ _ _ _ А];rcases Nat.lt_or_ge b 1447 with h | h .have w:=(bg e 0x4000000800000000 (ki (b-(1075+9))) Б Б А А).1 rw[w,(Б:(ap 0x4000000800000000)б=2^23),g];omega .obtain rfl:b=1447:=А cases e<;>decide lemma cE (S:р) (hS:fv S) (G:м) (hG:G<=2^26) (T:с) (l:1195<=(eF S.toBits)б) (m:(eF S.toBits)б<=1447) (as:G+1<=((S.toBits&&&0xfffffffffffff)б+2^28)%2^29) (a0:((S.toBits&&&0xfffffffffffff)б+2^28)%2^29+G<2^29) (hT: |rv S-(T:ℝ)| <= (G:ℝ)*(2:ℝ)^(((eF S.toBits)б:с)-1075)): T≠0/\(kb T (-298) false)в=S.toBitsб/2^63*2^31+ (((eF S.toBits)б-1195)*2^23+(2^23+((S.toBits&&&0xfffffffffffff)б+2^28)/2^29)):=by have N:=eJ S hS (λh0=>by rw[h0] at l;simp at l) rw[cq] at N have J:(if (S.toBits>>>63!=0)=true then 2^31 else 0)=S.toBitsб/2^63*2^31:=by simp only[bL,AO];have:=ϭ S.toBits;split<;>omega rw[<- J];have hf:=(fq S).2;generalize (S.toBits>>>63!=0)=j at* generalize (eF S.toBits)б=b at* generalize (S.toBits&&&0xfffffffffffff)б=g at* have K:(0:ℝ)<(2:ℝ)^((b:с)-1075):=В;have e:(0:ℝ)<(2:ℝ)^(-298:с):=В obtain ⟨A,B,L,U,y,wB,V,X,hL,hU,F,D⟩:∃(A B:jQ) (L U:ℕ), (jW (jM lx A))в=(if j=true then 2^31 else 0)+ ((b-1195)*2^23+(2^23+(g+2^28)/2^29)) /\ (jW (jM lx B))в=(if j=true then 2^31 else 0)+ ((b-1195)*2^23+(2^23+(g+2^28)/2^29)) /\ A.toReal=(if j then-(L:ℝ) else L)*2^((b:ℤ)-1075)*2^(-298:ℤ) /\ B.toReal=(if j then-(U:ℝ) else U)*2^((b:ℤ)-1075)*2^(-298:ℤ) /\ L+G<= g+2^52/\g+2^52+G<= U/\U<=2^53+2^26/\0omega have Z:jL (jW (jM lx A))≠255:=λO=>by have:=Dense.aR (jW (jM lx A));rw[O,Dense.aQ,y] at this;simp only[jN] at this;omega have qz:jW (jM lx A)&&&0x7FFFFFFF≠0:=λO=>by have:=Dense.aQ (jW (jM lx A));simp only[Dense.au,O,y,ϋ] at this;omega have r:jW (jM lx A)=jW (jM lx B):=η.mp (y.trans wB.symm);have E:(L:ℝ)+G<= g+2^52:=by exact_mod_cast hL have H:(g:ℝ)+2^52+G<= U:=by exact_mod_cast hU have Y:(U:ℝ)<=2^53+2^26:=by exact_mod_cast F have w:(0:ℝ) |(ka x (-298)).toReal| <= ((2^24-1:ℕ):ℝ)*(2:ℝ)^(104:с):=by intro x h;rw[al,abs_mul,Ah e] calc |(x:ℝ)| *(2:ℝ)^(-298:с)<= U*u*(2:ℝ)^(-298:с):=AE h e.le _<=(2^53+2^26)*2^(372:с)*(2:ℝ)^(-298:с):=by gcongr _=(2^53+2^26)*2^(74:ℕ):=by rw[Au,z] _<=((2^24-1:ℕ):ℝ)*(2:ℝ)^(104:с):=by rw[v];norm_num cases j<;>simp only[ς,↓reduceIte] at N V X Q R<;>rw[N] at Q R<;>push_cast at Q R p1 p2 .have o:(L:ℝ)*u<= T:=by linarith have q:(T:ℝ)<= U*u:=by linarith have p:T≠0:=by rintro rfl;push_cast at o;linarith refine ⟨p,?_⟩;simp only[kb,p,↓reduceIte];rw[gL A (ka T (-298)) B ?_ ?_ r Z qz (t T (abs_le.mpr ⟨by linarith,q⟩)),y] .rw[V,al];have:=AE o e.le;linarith .rw[X,al];have:=AE q e.le;linarith .have o:(T:ℝ)<=-(L*u):=by linarith have q:-(U*u)<=(T:ℝ):=by linarith have p:T≠0:=by rintro rfl;push_cast at o;linarith refine ⟨p,?_⟩;simp only[kb,p,↓reduceIte];rw[gL B (ka T (-298)) A ?_ ?_ r.symm (r ▸ Z) (r ▸ qz) (t T (abs_le.mpr ⟨q,by linarith⟩)),wB] .rw[X,al];have:=AE q e.le;linarith .rw[V,al];have:=AE o e.le;linarith @[inline,irreducible] def ak (S:р) (h:Д):Д:= let b:=S.toBits let f:=b&&&0xfffffffffffff let E:=eF b let d:=h+1075-E let g:=(1:Д)<<>>29 if d<=26&&E-1195<253&&u-(g+1)<536870911-(g+g)&&r&&&8388607!=0 then ((b>>>63)<<<31)+r-0x255000000 else Ж lemma rb (b:Д) (h:(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29&&&8388607!=0)=true): 2^28<=(b&&&0xfffffffffffff)б/\(b&&&0xfffffffffffff)б+2^28<2^52:=by simp only[AS,An,<- κ,ο,ψ,μ, jI,jO,δ] at h⊢ rw[γ _ 63,γ _ 23] at h;rw[γ _ 52];omega lemma jm (h E f:Д) (p:hб<2^63) (m:Eб<2048) (o:fб<2^52) (b:h+1075-E<=26) (g:E-1195<253) (e:((f+268435456)&&&536870911)-(((1:Д)<<<(h+1075-E))+1)< 536870911-(((1:Д)<<<(h+1075-E))+((1:Д)<<<(h+1075-E)))) (l:2^28<= fб/\fб+2^28<2^52): Eб<= hб+1075/\hб+1075-Eб<=26/\1195<= Eб/\Eб<=1447 /\ 2^(hб+1075-Eб)+1<=(fб+2^28)%2^29 /\ (fб+2^28)%2^29+2^(hб+1075-Eб)<2^29 /\ 2^(hб+1075-Eб)<= fб/\fб+2^(hб+1075-Eб)<2^52:=by simp only[τ,θ,Τ,μ,ο, υ,jI,ld,A6] at b g e have j:(2^64-Eб+(hб+1075)%2^64)%2^64=hб+1075-Eб:=А;rw[j] at b e;have:=Η (n:=2) Г b;rw[ι (by omega:_<64),γ _ 29] at e omega lemma iF (b:Д) (e:1195<=(eF b)б): (((b>>>63)<<<31)+(((b&&&0x7FFFFFFFFFFFFFFF)+268435456)>>>29)-0x255000000)б= bб/2^63*2^31+(((eF b)б-1085-110)*2^23+ (2^23+((b&&&0xfffffffffffff)б+2^28)/2^29)):=by simp only[eF,Τ,μ,υ,ψ, ο,jI,jO,δ,χ] at e⊢ rw[γ _ 11] at e⊢;rw[γ _ 63,γ _ 52];have:=b.toNat_lt;omega lemma bt (S:р) (t:fv S) (h:Д) (w:hб<2^63) (T:с) (u: |rv S-(T:ℝ)| <= (2:ℝ)^(hб:с)) (v: |(T:ℝ)| <= (2:ℝ)^(425:с)) (e:ak S h<Ж):T≠0/\(ak S h)ж=kb T (-298) false:=by unfold ak at e⊢;dsimp only at e⊢ split;swap;. simp[*] at e rename_i b;simp only[Μ,AO] at b;obtain ⟨⟨⟨j,l⟩,m⟩,o⟩:=b;obtain ⟨A,p,g,q,y,z,-,-⟩:=jm h (eF S.toBits) _ w (fq S).1 (fq S).2 j l m (rb _ o) obtain ⟨r,x⟩:=cE S t _ (Η Г p) T g q y z (u.trans_eq (by rw[Nat.cast_pow,lK,<- AA,<- AQ AH];congr 1;omega)) refine ⟨r,η.mp ?_⟩;rw[x,Ν,iF _ g];have:=(fq S).2;have:=ϭ S.toBits;omega @[specialize] def ab (p:м-> р) (n t:м) (a:р):р:= if t с) (e:с) (B:ℝ) (g:∀tintro _;simpa using b | succ t h=> intro j;rw[Λ,<- add_assoc];push_cast;linarith[abs_add_le ((e:ℝ)+∑s∈j3 t,(z s:ℝ)) (z t),h А,g t А] structure A8 where a0:р a1:р a2:р a3:р a4:р a5:р a6:р a7:р local instance:Inhabited A8:=⟨⟨0,0,0,0,0,0,0,0⟩⟩ @[inline] def A8.f (s:A8):м-> р | 0=>s.a0 | 1=>s.a1 | 2=>s.a2 | 3=>s.a3 | 4=>s.a4 | 5=>s.a5 | 6=>s.a6 | _=>s.a7 lemma uk {i k:н} {S:м} (b:kа<8) (h:iа+8<= S) (e:S<2^32): (i+k)а k+e<= f->(m:ℝ)*2^e<2^f:=λm k e f h j=> (AZ (by exact_mod_cast h:(m:ℝ)<2^k) (Ao Ae e)).trans_le (by rw[<- AA,<- AQ AH];exact AG Г j) unfold rv eF;unfold fv at g;rw[eU] at g⊢;rw[lB,ϫ _ _ _ _ (fq v).1 (fq v).2 g];have:=(fq v).2;split_ifs with l<;>simp only[Model.Dyadic.abs_toReal] .simp;positivity .exact b _ 52 _ _ this (by rw[l];decide) .exact b _ 53 _ _ (by simp only[jK,lG];omega) (by simp[jK];omega) lemma iO (x y:р) (l:fv x) (m:fv y) (r:fv (x+y)) (E:с) (e:-1074<= E) (g:E<=971) (h: |rv (x+y)| <(2:ℝ)^E): |rv x+rv y| <(2:ℝ)^E:=by have j:=fR x y l m;have q:=kM _ _ Б l m (j ▸ r);unfold rv at h⊢;rw[j,q,abs_lt] at h;have p:=rx ⟨false,1,E⟩ Г e (by simp[cq];exact AG Г g) have o:=rx ⟨true,1,E⟩ Г e (by simp[cq];exact AG Г g) simp only[cq,ς,AP,AY,md,Am,neg_mul] at p o exact abs_lt.2 ⟨lt_of_not_ge λb=>by linarith[ϯ jK b], lt_of_not_ge λb=>by linarith[ϯ jK b]⟩ @[specialize] def sT (p:м-> р) (n t:м) (a:р) (m:Д):р×Д:= if trename_i h<;>simp only[θ] at h<;>omega lemma iv (p:м-> р) (n:м):∀k t a m,n-t=k-> mб<=(sT p n t a m).2б:=by intro k;induction k with | zero=>intro t a m h;rw[sT,AB А] | succ k b=> intro t a m h;rw[sT,AD А];dsimp only;have:=b (t+1) (a+p t) (if m р) (z:м-> с) (q:с) (n K:м) (u:1<= K) (v:K<=1993) (x:∀t t<= n-> fv a -> |rv a-((q:ℝ)+∑s∈j3 t,(z s:ℝ))| <= t*(2:ℝ)^((K:с)-1076) -> (sT p n t a M).2б<= K -> fv (sT p n t a M).1 /\ |rv (sT p n t a M).1-((q:ℝ)+∑s∈j3 n,(z s:ℝ))| <= n*(2:ℝ)^((K:с)-1076):=by intro m;induction m<;>intro t a M B D h g j .obtain rfl:t=n:=А rw[sT,AB (AU _)];exact ⟨h,g⟩ rename_i y;have b:tlinarith only[e.1,e.2,g.1,g.2,A] lemma cw (n:м) (b e:м-> jJ) (g:ao n b e) (S:р) (m:fv S) (h:Д) (q:hб<2^63) (o: |rv S-(ah n b e:ℝ)| <= (2:ℝ)^(hб:с)) (l: |(ah n b e:ℝ)| <= (2:ℝ)^(425:с)) (p:ak S h<Ж): (ak S h)ж=ku n b e:=by obtain ⟨j,r⟩:=bt S m h q _ o l p;rw[r,aq n b e g j] def aC (A:о п) (i:н) (m:Е):Е:= if h:i>>23)&&&255 aC A (i+1) (if m mв<=(aC A i m)в /\ ∀q,iа<= q-> q(jL A[q]!)в<=(aC A i m)в:=by intro k;induction k<;>intro i m u .have h:¬iby have:=bQ h;omega rw[aC,AI h];exact ⟨AJ,λq g b=>А⟩ rename_i t;have h:iby split<;>rename_i j<;>simp only[ν] at j<;>omega obtain ⟨p,r⟩:=t (i+1) (if m<(A.uget i (bQ h)>>>23)&&&255 then (A.uget i (bQ h)>>>23)&&&255 else m) (by rw[ae h];omega) rw[o] at p;refine ⟨А,λq g b=>?_⟩ rcases eq_or_ne q iа with rfl | e .rw[<- fF A i (bQ h)];unfold jL;omega exact r q (by rw[ae h];omega) b lemma cL (A:о jJ) (j:Aгby rw[e] at b;simp at b g;omega,by rw[aS];omega⟩ @[specialize] def b9 (k:м-> т) (p:м-> р) (n t:м) (a:р):р:= if t р) (n:м):∀m t a,n-t=m-> ab p n t a=b9 (λ_=>false) p n t a:=by intro m;induction m<;>intro t a h<;>unfold ab b9 .grind .grind lemma bn (k:м-> т) (p:м-> р) (z:м-> с) (e:с) (P L n:м) (D:∀t z t=0) (E:∀t t<= n-> fv a -> |rv a-((e:ℝ)+∑s∈j3 t,(z s:ℝ))| <= t*((2:ℝ)^(P+L)*2^(-54:с)) -> fv (b9 k p n t a) /\ |rv (b9 k p n t a)-((e:ℝ)+∑s∈j3 n,(z s:ℝ))| <= n*((2:ℝ)^(P+L)*2^(-54:с)):=by have w:(2:ℝ)^L*2^L*2^(-54:с)<=1:=by rw[<- AM,<- AA,<- AQ AH];exact zpow_le_one_of_nonpos₀ Г (by push_cast;omega) intro m;induction m<;>intro t a G H g o .obtain rfl:t=n:=А rw[b9,AB (AU _)];exact ⟨g,o⟩ rename_i q;have b:tlinarith obtain ⟨u,r⟩:=ii a (p t) g v (P+L) А (by rw[AM,abs_lt];constructor<;>linarith) refine q (t+1) (a+p t) А А u ?_;push_cast[Λ,AM,abs_le] at r⊢;constructor<;>linarith lemma cD (a b:jJ) (A B:м) (m:jS a<= A) (o:jS b<= B): |(tm a b:ℝ)| <= (2:ℝ)^(48+A+B):=by have g:=cz a;have h:=cz b have e:(tm a b)з<=2^(48+A+B):=by unfold tm;rw[ϙ,ϙ,Int.natAbs_pow];rw[ϟ] at g h;have j:(sv a)з<=2^24:=А;have l:(sv b)з<=2^24:=А calc (sv a)з*(sv b)з*(2:с)з^(jS a+jS b) <= 2^24*2^24*2^(A+B):=by apply Ϥ (Ϥ j l);exact Η Г А _=2^(48+A+B):=by rw[<- AM,<- AM];congr 1;omega rw[<- lu,ϟ];exact_mod_cast e @[inline] def tS (relu:т) (L n:м) (p:м-> р) (bpf:Unit-> р) (an:Unit-> п):п:= let r:=sT p n 0 (bpf ()) 0 let c:=if 1<= r.2б/\r.2б<=1993/\1076<= r.2б+L then ak r.1 (r.2б+L-1076).toUInt64 else Ж if c<Ж then act relu cж else an () @[inline] def tf (relu:т) (S:р) (hh:Д) (sl:Unit-> п):п:= let c:=ak S hh if c<Ж then act relu cж else sl () @[inline] def tw (relu:т) (S:р) (hh:Д) (L n:м) (p:м-> р) (bpf:Unit-> р) (an:Unit-> п):п:=tf relu S hh λ_=>tS relu L n p bpf an lemma gP (g:т) (n:м) (b e:м-> jJ) (p:м-> р) (j:Unit-> р) (r:Д) (P L:м) (x:Unit-> jJ) (G:∀sz s H.le) (z n AJ) n AJ).trans ?_ calc ((n:ℝ)+1)*2^P<=2^L*2^P:=by gcongr;exact_mod_cast (by omega:n+1<=2^L) _<=2^425:=by rw[<- AM];exact AN Г А simp only[tw,tf,tS];split_ifs with E q v<;>try exact F .exact congrArg _ (cw _ _ _ h _ B r (by rw[w];omega) u m E) .obtain ⟨t,l⟩:=gK _ _ (tm (b n) (e n)) n _ q.1 q.2.1 G n 0 _ 0 rfl А o.1 (by simp[o.2]) AJ rw[<- A] at l refine congrArg _ (cw _ _ _ h _ t _ ?_ (l.trans ?_) m v)<;> rw[lC,Ε (by simp only[j6];omega)] .omega refine (AE (by exact_mod_cast (by omega:n<=2^L):(n:ℝ)<=2^L) В).trans_eq ?_ rw[<- AA,<- AQ AH];congr 1;omega .exact absurd ‹_› Б lemma gg (X:FloatArray) (i:м):X.get! i=X.data[i]!:=by rcases X with ⟨d⟩;rfl lemma f8 (v:р) (r:м):A8.f ⟨v,v,v,v,v,v,v,v⟩ r=v:=by unfold A8.f;split<;>rfl @[specialize] def bB {α:Type} (f:м-> α) (N:м) (a:о α):о α:= if aг α) (N:м): bB f N (j2 N)=kn (n:=N) λq=>f qи:=by suffices h:∀k (a:о α),N-aг=k-> aг<= N->(∀i (h:i bB f N a=kn (n:=N) λq=>f qи from h _ _ rfl (by simp) (λi h=>by simp at h) intro k;induction k with | zero=> intro a j g b;rw[bB,AB А];exact li (by simp;omega) λi e _=>by rw[b i e,Ξ] | succ k l=> intro a j g b;rw[bB,AD А];refine l _ (by simp;omega) (by simp;omega) λi h=>?_ rw[Array.getElem_push];split .exact b i ‹_› .grind end F @[inline] def l1 (n:м) (relu:т) (X W b:о п) (P L i j:м):п:= F.tw relu (F.b9 (λ_=>false) (λs=>F.dw X[i*n+s]!*F.dw W[j*n+s]!) n 0 (F.dw oneW*F.dw b[j]!)) (P+2*L-54).toUInt64 L n (λs=>F.dw X[i*n+s]!*F.dw W[j*n+s]!) (λ_=>F.dw oneW*F.dw b[j]!) λ_=>act relu (dotOf (n+1) (λs=>if sif sif sif sby split exacts [(F.cD _ _ _ _ (v _).2 (u _).2).trans (AN Г D), (F.cD _ _ 126 _ Б (r _).2).trans (AN Г E)] have l:=F.bZ jR b[j]! Б (r _).1 have A:∀sby simpa[t] using F.bZ _ _ (v _).1 (u _).1 obtain ⟨H,G⟩:=F.bn (λ_=>false) _ _ (tm jR b[j]!) P L n A (λ_ _ h=>absurd h ϰ) (λs t=>B s t.le) (by simpa using B n AJ) o g А n 0 _ rfl n.zero_le l.1 (by simp[l.2]) have m:(P+2*L-54).toUInt64б=P+2*L-54:= Ε (by simp only[j6];omega) refine F.gP e n _ _ _ _ _ P L _ A (by simpa using l) (λs _=>by beta_reduce;split;exacts [⟨(v _).1,(u _).1⟩,⟨Б,(r _).1⟩]) B o g p m rfl _ H ?_ rw[aw,ah,m,(А:((P+2*L-54:м):с)=P+L+L+(-54))] have I:=sub_nonneg.mpr (by exact_mod_cast o:(n:ℝ)+2<=2^L) have z:(0:ℝ)<2^P*2^(-54:с):=В;push_cast[AQ (two_ne_zero' ℝ),AA,AU,AM,abs_le] at G⊢;constructor<;>linarith[Ap I (mul_pos z (pow_pos Ae L)).le,(mul_pos z (pow_pos Ae L)).le] def cv (ba inW outW:м) (relu:т) (X W b:о п):о п:= let P:=max (48+((F.aC X 0 0)в-1)+((F.aC W 0 0)в-1)) (174+((F.aC b 0 0)в-1)) let L:=Ar (inW+1)+1 if h:F.aC X 0 0<255/\F.aC W 0 0<255/\F.aC b 0 0<255/\P+L<=425/\L<=27/\Xгl1 inW relu X W b P L (qи/outW) (qи%outW) else linearSpec ba inW outW relu X W b lemma dI:cv=linearSpec:=by funext l e g j X W b;unfold cv;dsimp only;split .rename_i h unfold linearSpec linearWith;congr 1;funext q exact ik _ _ _ _ _ _ _ _ _ _ _ _ (F.cL X h.2.2.2.2.2.1 h.1) (F.cL W h.2.2.2.2.2.2.1 h.2.1) (F.cL b h.2.2.2.2.2.2.2 h.2.2.1) (le_max_left _ _) (le_max_right _ _) (by have:=@Ϻ (e+1);omega) h.2.2.2.2.1 h.2.2.2.1 .rfl end Dense namespace Bn namespace NativeAdd lemma dq (x:Float32):lL x.toModel=k4 x.toBits:= congrArg Model.mk (lX x.toBits).symm lemma ip (x:Float32):jW (lL x.toModel)=x.toBits:= UInt32.ofNat_toNat lemma bf (a:jJ) (h:jL a≠255): (kU a).toBits=a/\(kU a).isFinite=true:=by have g:lH (spec:=j9) a.toBitVec≠-1#8:=by intro b;apply h;apply η.mp rw[show (jL a)в=(a.toBitVec.extractLsb' 23 8).toNat by simp only[jL,ξ,Ι,BitVec.extractLsb'_toNat];exact γ _ 8] exact (congrArg BitVec.toNat b:) have e:(kU a).toBits=a:=by change Ax (mj j9 (jU j9 a.toBitVec))=a rw[Model.pack_unpack_eq,AB (g ·.1)] refine ⟨e,?_⟩;change (jU j9 (kU a).toBits.toBitVec).isFinite=true;simp only[e,jU,g,AP];split<;>(try split)<;>rfl @[noinline] def eh (relu:т) (a b:п):п:= act relu (toWord (Model.add (ofW a) (ofW b))) @[inline] def d5 (relu:т) (w:п):п:= w&&&~~~((0:п)-((if relu then w>>>31 else 0)&&&(if w&&&0x7FFFFFFF<=0x7F800000 then 1 else 0))) lemma gM (w:jJ):(w&&&0x80000000!=0)=decide (2^31<= wв):=by have e:=w.toNat_lt rw[ϛ,AS,An,<- η,ξ,decide_eq_true_iff, show (0x80000000:Е)в=2^31 from rfl,kH] simp only[ϋ,Nat.testBit,δ,Nat.one_and_eq_mod_two];constructor .intro h;by_contra b;apply h;rw[Nat.div_eq_of_lt А];simp .intro h;rw[(А:wв/2^31=1)];simp lemma fr (b:т) (w:jJ):d5 b w=mc b w:=by have v:=w.toNat_lt;have t:(w>>>31)в=wв/2^31:=by rw[Ι];simp[δ] have m:=Dense.aQ w;have q:=Dense.aR w have r:(kc w)в=wв%2^23:=by unfold kc;rw[ξ];exact γ _ 23 unfold Dense.au at m q have o:∀x:jJ,x&&&~~~((0:jJ)-0)=x:=λx=>by apply η.mp;rw[ξ];rw[show (~~~((0:jJ)-0))в=2^32-1 from rfl,γ,ι x.toNat_lt] have u:∀x:jJ,x&&&~~~((0:jJ)-1)=0:=λx=>by apply η.mp;rw[ξ];simp have j:w>>>31=if 2^31<= wв then 1 else 0:=by apply η.mp;rw[t];split<;>simp<;>omega have p:(w&&&0x7FFFFFFF<=0x7F800000)↔wв%2^31<=0x7F800000:=by rw[Ζ,m];rfl have l:(w&&&0x80000000!=0&&!(jL w=255&&kc w !=0))=true↔ (2^31<= wв/\wв%2^31<=0x7F800000):=by rw[gM] simp only[Μ,AO,Bool.not_eq_true',Bool.and_eq_false_iff,decide_eq_false_iff_not, bne_eq_false_iff_eq,<- η,q,r,m,jN,ϋ] omega unfold d5 mc;cases b .simp only[ς,AP,Aw,o] simp only[AY];unfold reluW;rw[j];by_cases e:2^31<= wв .rw[AD e] by_cases g:wв%2^31<=0x7F800000 .rw[AD (p.mpr g),show (1:jJ)&&&1=1 from rfl,u,AD (l.mpr ⟨e,g⟩)] .rw[AB (mt p.mp g),show (1:jJ)&&&0=0 from rfl,o,AB (λh=>g (l.mp h).2)] .rw[AB e,Aw,o,AB (λh=>e (l.mp h).1)] @[inline] def add (relu:т) (a b:п):п:= if expOf a !=255&&expOf b !=255 then d5 relu (A2 a+A2 b).toBits else eh relu a b lemma fV (e:т) (a b:jJ): add e a b=mc e (jW (lR (k4 a) (k4 b))):=by unfold add;split .rename_i h rw[fr];simp only[Μ,AS] at h;have g:=bf a h.1;have j:=bf b h.2;have l:=ExecFloat.Binary.toModel_ofFloat32_add_of_isFinite _ _ g.2 j.2;simp only[ExecFloat.Binary.toModel_ofFloat32,dq,g.1,j.1] at l;rw[<- l,<- dq,ip] .rfl end NativeAdd lemma dF (x s t:jJ) (o:jL x≠255) (l:jL s≠255) (m:jL t≠255) (V:с) (j:V=sv x*sv s*2^(jS x+jS s)+sv t*2^(jS t+149)) (h:V≠0): jW (Ak (k4 x) (k4 s) (k4 t))=kb V (-298) false:=by have g:=jV x o;have b:=jV s l;have e:=jV t m;open Model in .rw[Proof.fma_eq_spec] simp (disch:=assumption) only[Spec.fma,k4,(chooseNaN3_eq_none_iff _ _ _).2 ⟨kj g, kj b,kj e⟩,isInf_eq_false_of_toDyadic?_some, Bool.or_false,ς,AP,g,b,e] refine (kz _ V _ _ h ?_).symm;rw[addDyadic,l6];erw[l7 (lv x) (lv s)];simp[lZ,j,Af];field_simp;ring @[inline] def ad (rb:Е) (a b:п) (_slow:Unit-> п):п:=NativeAdd.add (rb !=0) a b @[specialize] def bR (stop:н) (f:(i:н)-> iа п-> п) (i:н) (x:о п) (h:stopа<= xг):о п:= if hi:i iа jJ-> jJ) (F:м-> jJ-> jJ) (l:∀i e w,f i e w=F iа w) (i:н) (x:о jJ) (h:bа<= xг): (bR b f i x h)г=xг /\ ∀j,(bR b f i x h)[j]?=if iа<= j/\j refine ⟨by rw[g.1,Ρ],λj=>?_⟩ rw[g.2,Dense.ae e,Ϡ,Array.getElem?_set А];split_ifs<;>first | rfl | omega | (subst_vars;rw[Ϫ А,Option.map_some,l];rfl) .next i x h e=>exact ⟨rfl,λj=>by rw[AB (by rw[β] at e;omega)]⟩ lemma g7 (e:т) (a b:jJ) (g:Unit-> jJ) (h:g ()=mc e (jW (lR (k4 a) (k4 b)))): ad (if e then 1 else 0) a b g=mc e (jW (lR (k4 a) (k4 b))):=by cases e<;>simp[ad,NativeAdd.fV] @[noinline] def i4 (relu:т) (x y:п):п:=act relu (toWord (Model.add (ofW x) (ofW y))) def bJ (relu:т) (a b:о п):о п:= if h:aг<= bг/\aг let y:=b.uget i (by rw[Dense.aa h.2] at hi;omega) ad rb x y λ_=>i4 relu x y) 0 a (by rw[Dense.aa h.2]) else addReluSpec relu a b lemma cZ:bJ=addReluSpec:=by funext e a b;unfold bJ;dsimp only split;swap;. rfl rename_i h;have l:=Dense.aa h.2;refine l9 λj=>?_ rw[(ca _ _ (λj x=>mc e (jW (lR (k4 x) (k4 b[j]!)))) (λi m x=>?_) 0 a _).2 j, addReluSpec,lT] .by_cases g:j>>29 if (w<<<1)-lo>>(34:Д))<<<(31:Д)) ||| ((x&&&(0x3FFFFFFFF:Д))-((1194:Д)<<<(23:Д))) else Ж lemma wF (b r x:Д) (e g:м) (o:rб=e*2^53) (q:xб=g*2^53) (K:1195<= e) (L:e+g<=1448) (h:aL b r x<Ж): e<=(eF b)б/\(eF b)б<=1447/\2^19+1<=((b&&&0xfffffffffffff)б+2^28)%2^29 /\ ((b&&&0xfffffffffffff)б+2^28)%2^29+2^19<2^29 /\ (aL b r x)жв=bб/2^63*2^31+ (((eF b)б-1195)*2^23+(2^23+((b&&&0xfffffffffffff)б+2^28)/2^29)):=by unfold aL at h⊢;dsimp only at h⊢ split at h;swap;. simp at h rename_i j;rw[AD j];have:=ϭ b simp only[Μ,AO,AS,An,θ,<- κ, Τ,μ,ο,kG,υ,ψ, Ν,eF,jI,jO,χ,δ,o,q] at j⊢ rw[γ _ 29,γ _ 23] at j;rw[γ _ 11,γ _ 52,γ _ 34];generalize bб=n at* obtain ⟨⟨A,B⟩,D⟩:=j obtain ⟨s,E,f,H,M,G,rfl⟩:∃s E f,s<2/\E<2048/\f<2^52/\n=s*2^63+E*2^52+f:= ⟨n/2^63,n/2^52%2^11,n%2^52,А,А,А,А⟩ have t:(s*2^63+E*2^52+f)/2^63=s:=А;have u:(s*2^63+E*2^52+f)/2^52%2^11=E:=А;have v:(s*2^63+E*2^52+f)%2^52=f:=А;have w:(s*2^63+E*2^52+f)*2^1%2^64=E*2^53+2*f:=А;rw[w] at A;rw[t,u,v];have l:e<= E/\E<1448:=by clear B D t u v w;omega have y:(s*2^63+E*2^52+f+267386879)%2^64/2^29= s*2^34+E*2^23+(f+267386879)/2^29:=А have z:(s*2^63+E*2^52+f+267386879)%2^64%2^29=(f+267386879)%2^29:=А;rw[z] at B;rw[y] at D⊢;clear t u v w y z A;have I:(s*2^34+E*2^23+(f+267386879)/2^29)/2^34=s:=А;have J:(s*2^34+E*2^23+(f+267386879)/2^29)%2^34=E*2^23+(f+267386879)/2^29:=А;clear h;have p:s*2^31<2^64:=by clear*-H;omega have m:(E-1194)*2^23+(f+267386879)/2^29<2^31:=by clear*-l G;omega have F:(2^64-1194*2^23%2^64+(E*2^23+(f+267386879)/2^29))%2^64= (E-1194)*2^23+(f+267386879)/2^29:=А rw[I,J,F,ι p,Ϩ s,<- ϊ m];omega lemma d4 (S:р) (t:fv S) (h j:Д) (b g H:м) (l:hб=b*2^53) (m:jб=g*2^53) (q:1195<= b) (r:b+g<=1448) (D:H+1056<= b) (T:с) (u: |rv S-(T:ℝ)| <= (2:ℝ)^(H:с)) (w:aL S.toBits h j<Ж): T≠0/\(aL S.toBits h j)ж=kb T (-298) false/\jL (aL S.toBits h j)ж≠255:=by obtain ⟨E,z,A,B,o⟩:=wF S.toBits h j b g l m q r w have v:(2:ℝ)^(H:с)<=((2^19:м):ℝ)*(2:ℝ)^(((eF S.toBits)б:с)-1075):=by rw[Nat.cast_pow,lK,<- AA,<- AQ AH];exact AG Г А obtain ⟨p,y⟩:=cE S t (2^19) Г T А z A B (u.trans v);refine ⟨p,η.mp (by rw[y,o]),λx=>?_⟩ have e:=Dense.bS (aL S.toBits h j)ж;have f:=(fq S).2;rw[x,o] at e;simp only[jN] at e;omega @[inline] def aA (relu:т) (w:п):п:=if relu&&w&&&0x80000000!=0 then 0 else w lemma d6 (b:т) (w:jJ) (e:jL w≠255):aA b w=mc b w:=by unfold aA mc reluW;cases b<;>simp[e] @[inline] def wE (hh:Д):Д:=let e:=hh+1056;if e<1195 then 1195 else if e<1448 then e else 1448 @[inline] def cF (hh:Д):Д:=wE hh<<<53 @[inline] def cd (hh:Д):Д:=(1448-wE hh)<<<53 lemma iy (b:Д) (g:bб<2^63):1195<=(wE b)б/\(wE b)б<=1448 /\ (cF b)б=(wE b)б*2^53/\(cd b)б=(1448-(wE b)б)*2^53 /\ (bб+1056<=(wE b)б\/(wE b)б=1448):=by have e:1195<=(wE b)б/\(wE b)б<=1448/\(bб+1056<=(wE b)б\/(wE b)б=1448):=by unfold wE;dsimp only;split_ifs<;>simp only[θ,μ,jI] at*<;>(try simp only[or_true,and_true])<;>omega refine ⟨e.1,e.2.1,?_,?_,e.2.2⟩<;>simp only[cF,cd,υ,Τ,jI, jO,χ]<;>omega lemma ey (w b:Д):¬aL w b 0<Ж:=by unfold aL;dsimp only;rw[AB (by simp)];decide @[inline] def fW (relu:т) (lo sp:Д) (S:р) (sl:Unit-> п):п:= let c:=aL S.toBits lo sp if c<Ж then aA relu cж else sl () @[inline] def fA (af:п-> п) (lo sp:Д) (S:р) (sl:Unit-> п):п:= let c:=aL S.toBits lo sp if c<Ж then af cж else sl () lemma ie (g:jJ-> jJ) (b:т) (e:∀w,g w=aA b w) (h l:Д) (S:р) (j:Unit-> jJ):fA g h l S j=fW b h l S j:=by unfold fA fW;simp only[e] lemma ig (b:т) (n:м) (e g:м-> jJ) (l:ao n e g) (S:р) (v:fv S) (h:Д) (y:hб<2^63) (w: |rv S-(ah n e g:ℝ)| <= (2:ℝ)^(hб:с)) (x: |(ah n e g:ℝ)| <= (2:ℝ)^(425:с)) (r:Unit-> jJ) (p:r ()=mc b (ku n e g)):fW b (cF h) (cd h) S r=mc b (ku n e g):=by unfold fW;dsimp only;split .rename_i o obtain ⟨t,B,u,q,j⟩:=iy h y;rcases j with j | j .obtain ⟨m,z,A⟩:=d4 S v _ _ _ _ _ u q t А j _ w o rw[d6 _ _ A,z,aq n e g l m] .exfalso;rw[show cd h=0 from κ.mp (by rw[q,j];rfl)] at o;exact ey _ _ o .exact p lemma jB (b:т) (n:м) (e g:м-> jJ) (p:м-> р) (h:Unit-> р) (l:Д) (P L:м) (q:Unit-> jJ) (A:∀stw b S l L n p h q)=mc b (ku (n+1) e g):=by have u: |(ah (n+1) e g:ℝ)| <= (2:ℝ)^(425:с):=by rw[aw,ah,zpow_ofNat];push_cast;rw[add_comm];refine (bm n _ _ _ (λs B=>r s B.le) (r n AJ) n AJ).trans ?_ calc ((n:ℝ)+1)*2^P<=2^L*2^P:=by gcongr;exact_mod_cast (by omega:n+1<=2^L) _<=2^425:=by rw[<- AM];exact AN Г А exact ig b (n+1) e g j S x l А o u _ (gP b n e g p h l P L q A v j r y m t w z S x o) end Fac namespace Conv open Core Finset variable (C E V S:Д) (y z:jJ) (t:т) (P W:о Е) (c h w k n:м) (Q:jJ-> т) (fa:м-> jJ) (bx:Д) (s:ke) (J:т) (I K b:о jJ) (D:т) (nc Y:м) (r d:jJ) (x:Д) (v:с) (B a:Д) (m:м) (e j:н) (bw:Д) (u:Е) {α:Type} lemma mo {a b:м} (h:asimp[*] lemma jq {n:м} (h:n<2^32):n%2^ks=n:=mo (Ac h bi) @[specialize] def lp (H:м) (f:м-> м-> о Е-> о Е): м-> м-> м-> о Е-> о Е | 0,_,_,a=>a | n+1,o,y,a=> let a:=f o y a if y+1 н-> Е) (s:н) (x:м):м-> н-> о Е-> о Е | 0,_,a=>a | m+1,e,a=>dQ f s (x+1) m (e+s) (a.push (f x e)) @[inline] def gN (O H W:м) (f:м-> м-> м-> Е):о Е:= if 0dQ (λx _=>f o y x) 0 0 W 0) (O*H) 0 0 (Al (O*(H*W))) else #[] @[noinline] def an (kk k cb o y x:м):п:= Dense.gZ (k+1) (λi=>if iif ioneW abbrev DQ:у:=signOf d=false/\expOf d≠0/\expOf d<255 def bW (e:м) (w:Е):с:=sv w*2^(idxOf w-e) lemma bP (h:jX u=0):sv u=0:=by simp[sv,h] abbrev am (g:м-> Е):о Е:=Aa (n:=m) λq=>g qи lemma de (g:м-> Е):(am m g).push (g m)=am (m+1) g:=by simp[am,Array.ofFn_succ] lemma aB (o y x H W:м) (g:y м-> о Е-> о Е) (S:м-> о Е-> у) (j:∀o y a,y S (o*H+y) a-> S (o*H+y+1) (f o y a)):∀n o y a,y S (o*H+y) a-> S (o*H+y+n) (lp H f n o y a):=by intro n;induction n with | zero=>exact λ_ _ _ _=>id | succ n b=> intro o y a l h;have e:=j o y a l h;simp[lp];split_ifs with g .simpa only[lb,Nat.add_comm n 1] using b _ _ _ g e .obtain rfl:H=y+1:=А rw[show o*(y+1)+y+(n+1)=(o+1)*(y+1)+0+n by ring];exact b _ _ _ А (by rwa[show (o+1)*(y+1)+0=o*(y+1)+y+1 by ring]) lemma js (H W n c:м) (b:м-> м-> о Е-> о Е) (F:м-> м-> м-> Е) (l:0 o*H+y(∀j b o y (am M g)=am (M+W) g):lp H b n 0 0 (j2 c)=am (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W):=by have:=dK H b (λk a=>k<= n-> a=am (W*k) λq=>F (q/(H*W)) (q/W%H) (q%W)) (λo y a e p u=>by rw[p А];exact m _ _ _ _ e А λj r=>by simp[show W*(o*H+y)+j=(o*H+y)*W+j by ring,aB o y j H W e r]) n 0 0 _ l λ_=>rfl simpa[Ϩ W n] using this lemma gH (f:м-> н-> Е) (g:м-> Е) (s:н):∀m x e M, (∀j< m,g (M+j)=f (x+j) (e+s*jд))-> dQ f s x m e (am M g)=am (M+m) g:=by intro m;induction m<;>intro x e M b .rfl rename_i m o;have l:g M=f x e:=by simpa[show USize.ofNat 0=0 from rfl] using b 0 А rw[dQ,<- l,de,o _ _ _ λj p=>by rw[(А:M+1+j=M+(j+1)),b _ А,(А:x+(j+1)=x+1+j), show (j+1)д=jд+1 from USize.ofNat_add j 1,USize.mul_add,USize.mul_one, USize.add_assoc,USize.add_comm (s*_)]];congr 1;omega lemma im (H W n c:м) (s:н) (E:м-> м-> н) (F:м-> м-> м-> н-> Е) (b:0dQ (F o y) s 0 W (E o y)) n 0 0 (j2 c)= am (n*W) λq=>F (q/(H*W)) (q/W%H) (q%W) (E (q/(H*W)) (q/W%H)+s*(q%W)д):= js H W n c _ (λo y x=>F o y x (E o y+s*xд)) b λ_ _ _ _ _ _ e=> gH _ _ _ _ _ _ _ λj g=>by rw[e j g,ϩ] lemma aa (h:n<2^32):nда=n:=jq h @[inline] def aO (s:ConvShape) (I:о п) (c y x:м):п:= if csimp[*,AF] def dD (I:о п) (p n d:н) (hs:Iг<2^32) (hp:pа+nа<= Iг) (j:н) (X:FloatArray) (hd:dа+nа<= Xе/\Xе<2^32):FloatArray:= if h:j(dD I p n d g b j X hd)е=Xе /\ ∀qintro j X hd r<;>rw[dD] .rw[AI (by rw[β];omega)];exact ⟨rfl,λq _=>by rw[AB А]⟩ rename_i m o;have h:j?_ rw[l q (by rw[aD];exact e),Dense.ae h,da _ _ _ _ _ e,Dense.ac А] split_ifs<;>first | omega | (rw[cU,Dense.ac А];congr 2;omega) | rfl def RV (s:ConvShape) (r j:м) (p d:н) (n:м):у:= rby have:=ζ (s.h+2) h;omega lemma gJ {s:ke} {r j n m:м} {p d:н} (q:s.cin*s.h*s.w<= m) (h:RV s r j p d n) (o:j RV s (r+1) (j+1) (p+o) (d+g) n) /\ (¬(1<= r/\r<= s.h)-> RV s (if r+1=s.h+2 then 0 else r+1) (j+1) p (d+g) n):=by obtain ⟨F,⟨c,B,l⟩,x,m⟩:=id h;have:=ε;have q:=ζ (s.w+2) (А:j+1<= s.cin*(s.h+2)+3) rw[Β] at q;have b:(d+g)а=(j+1)*(s.w+2):=by rw[Dense.ac А,x,v,Β] refine ⟨λe=>⟨А,⟨c,А,?_⟩,b,m⟩,λe=>⟨by split<;>omega,?_,b,m⟩⟩ .have:=(gJ AJ h A e).1 rw[Dense.ac А,l,D,<- Β];congr 1;omega .split .exact ⟨c+1,by rw[Β];omega,by rw[l,Β];congr 1;omega⟩ .exact ⟨c,А,by rw[l];congr 2;omega⟩ def cM (I:о п) (s:ConvShape) (hs:Iг<2^32) (hI:s.cin*s.h*s.w<= Iг) (wU VU:н) (hw:wUа=s.w) (hV:VUа=s.w+2) (G:м) (hG:G=s.cin*(s.h+2)) (r j:м):(p d:н) -> (X:FloatArray)-> RV s r j p d Xе-> FloatArray:=id λp d X h=> if hj:j G-j=m -> (∀q (cM I s D o g l J H G e r j p d X h)е=N /\ ∀qintro r j p d X h N u hm v<;>rw[cM]<;>dsimp only[id] .rw[AI А];refine ⟨u,λq b=>?_⟩ rw[v q b,aO];split;. rfl have:=ζ (s.w+2) (А:s.cin*(s.h+2)<= j) rw[AB (by rw[Nat.div_lt_iff_lt_mul В,<- ϐ];omega)] rename_i m K;have A:jrename_i B;on_goal 2=>refine K _ _ _ _ _ _ _ u А λq b=>?_;rw[v q b] obtain ⟨R,U,Y⟩:=gJ o h (e ▸ A) B;obtain ⟨O,L⟩:=cr I p g (d+1) D А _ 0 X ⟨А,h.2.2.2.2⟩ rfl refine K _ _ _ _ _ _ _ (O.trans u) А λq b=>?_ rw[L q А,v q b,ρ] all_goals split_ifs<;>try first | omega | with_reducible rfl all_goals obtain ⟨x,rfl⟩:=Nat.exists_eq_add_of_le (А:(c*(s.h+2)+r)*(s.w+2)<= q);simp only[aB c r x _ (s.w+2) M А,aO];split_ifs<;>first | omega | with_reducible rfl | (congr 2;omega) lemma d0 (A:о м) (u:н) (h:uаomega def eY (f:м-> р):Dense.F.A8:=⟨f 0,f 1,f 2,f 3,f 4,f 5,f 6,f 7⟩ lemma eZ (f:м-> р) (r:м) (b:r<8):(eY f).f r=f r:=by unfold eY;interval_cases r<;>rfl lemma az (p:м-> р) (n t:м) (a:р) (h:t р) (n t:м) (a:р) (h:¬tomega lemma dg (b t:м):px b t<=2:=by unfold px;split<;>omega lemma df (b t e:м) (g:b=9\/b=1) (j:tsimp[pc]<;>omega abbrev go (s:ConvShape) (kk:м):у:= s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1/\kk=9\/s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\kk=1 lemma tV (b e g V:м):(Dense.F.bB (λt=>pc b t*g+py b t*V+px b t) (e*b) (j2 (e*b)))г=e*b /\ ∀tpc b t*g+py b t*V+px b t) (e*b) (j2 (e*b)))[t]! =pc b t*g+py b t*V+px b t:=by rw[Dense.F.gA];exact ⟨ly,λt j=>by rw[AF _ _ (by simpa using j),Ξ]⟩ lemma tM (b e g V:м) (l:b=9\/b=1): ∀tpc b t*g+py b t*V+px b t) (e*b) (j2 (e*b)))[t]! <= (e-1)*g+2*V+2:=λt j=>by rw[(tV b e g V).2 t j];have m:=ζ g (show pc b t<= e-1 by have:=df b t e l j;omega) have o:=ζ V (dh b t);have p:=dg b t;omega structure CD where s:ConvShape I:о п K:о п b:о п X:FloatArray T:о м D:т J:т k:м M:м L:м hh:Д Y:м kk:м hX:Xе<2^32 hK:Y*k<= Kг/\Kг<2^32 def eX:Bool:=System.Platform.target.startsWith "aarch64" structure CC (M:м) where Tz:о м Wz:FloatArray wo:м n:м h1:n<= Tzг h2:wo+n<= Wzе h3:wo+n<2^32 h4:∀td.X.get! (q+d.T[t]!)*Dense.F.dw d.K[ko+t]!) (λ_=>Dense.F.dw oneW*Dense.F.dw d.b[o]!) λ_=>act d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x) @[inline] def aA (relu:т) (w:п):п:=if relu&&w&&&0x80000000!=0 then 0 else w lemma d6 (b:т) (w:jJ) (e:jL w≠255):aA b w=mc b w:=by unfold aA mc reluW;cases b<;>simp[e] lemma dr (S:р) (h:Д) (e:Dense.F.ak S h<Ж): jL (Dense.F.ak S h)ж≠255:=by unfold Dense.F.ak at e⊢;dsimp only at e⊢;split_ifs at e⊢with b swap;. exact absurd e Б simp only[Μ,AO] at b;obtain ⟨⟨⟨-,l⟩,-⟩,-⟩:=b;have:=(Dense.F.eF S.toBits).toNat_lt have m:(S.toBits&&&0xfffffffffffff)б<2^52:=by rw[ο];exact AR Ϙ Б rw[θ,Τ] at l;simp only[jI] at l;have p:=Dense.F.iF S.toBits А;have o:S.toBitsб/2^63<2:=by have:=ϭ S.toBits;omega rw[θ] at e;simp only[jI] at e;intro g;have j:=congrArg kN g;rw[jL,ξ,Ι,Ν] at j;simp only[jN,jO,δ] at j;rw[γ _ 8,ι e,p] at j;omega @[inline] def bY (d:CD) (o y x:м) (S:р):п:= let c:=Dense.F.ak S d.hh if h:c<Ж then aA d.J cж else ow d o y x S lemma gD (d:CD) (o y x:м) (S:р):bY d o y x S=ow d o y x S:=by unfold bY;dsimp only;split .rename_i b;rw[d6 _ _ (dr _ _ b)];unfold ow Dense.F.tw Dense.F.tf;dsimp only;rw[AD b] .rfl @[inline] def br (d:CD) (o y:м) (xb:н) (r:м) (S:р):п:= let c:=Dense.F.ak S d.hh if c<Ж then aA d.J cж else ow d o y (xbа+r) S lemma dN (d:CD) (o y:м) (b:н) (r:м) (S:р):br d o y b r S=bY d o y (bа+r) S:=rfl @[inline] def su (a:о п) (u:н) (v:п):о п:= if h:u п) (n r q:м) (a:о п):о п:= if r jJ) (n q:м):∀m r (a b:о jJ),pl g n r q a=b-> n-r=m-> r<= n-> bг=aг /\ ∀irintro r a _ rfl o p;rw[pl,AB А];exact ⟨rfl,λi e=>by rw[AB А]⟩ | succ m u=> rintro r a _ rfl o p;obtain ⟨v,l⟩:=u (r+1) (a.set! (q+r) (g r)) _ rfl А А;rw[pl,AD А,v,A7];refine ⟨rfl,λi e=>?_⟩;rw[l i (by simp[e])];rcases eq_or_ne i (q+r) with rfl | j<;>[rw[Ϭ _ _ _ e];rw[ϴ _ _ _ _ j.symm]]<;>split_ifs<;>first | rfl | omega | (congr 1;omega) @[inline] def ln (d:CD) (o y:м) (xb nq q r:н) (S:р) (a:о п):о п:= if r(q+k)аDense.F.uk hk h.2.1 (by have:=h.2.2;omega) (((((((a.uset q (br d o y xb 0 A.a0) (by have:=h.2.1;omega)).uset (q+1) (br d o y xb 1 A.a1) (by simp only[Ρ];exact hu 1 (by simp only[AC];omega))).uset (q+2) (br d o y xb 2 A.a2) (by simp only[Ρ];exact hu 2 (by simp only[AC];omega))).uset (q+3) (br d o y xb 3 A.a3) (by simp only[Ρ];exact hu 3 (by simp only[AC];omega))).uset (q+4) (br d o y xb 4 A.a4) (by simp only[Ρ];exact hu 4 (by simp only[AC];omega))).uset (q+5) (br d o y xb 5 A.a5) (by simp only[Ρ];exact hu 5 (by simp only[AC];omega))).uset (q+6) (br d o y xb 6 A.a6) (by simp only[Ρ];exact hu 6 (by simp only[AC];omega))).uset (q+7) (br d o y xb 7 A.a7) (by simp only[Ρ];exact hu 7 (by simp only[AC];omega)) else gY d o y xb nq q A a lemma fx (g:м-> jJ) (n q:м):∀m r (a:о jJ),n-r=m-> r<= n -> pl g (n+1) r q a=(pl g n r q a).set! (q+n) (g n):=by intro m;induction m with | zero=> intro r a b e;have:r=n:=А;subst this;conv_lhs=>rw[pl,AD А,pl,AB А] conv_rhs=>rw[pl,AB А] | succ m j=> intro r a b e;conv_lhs=>rw[pl,AD А] rw[j (r+1) _ А А];conv_rhs=>rw[pl,AD А] lemma jr (d:CD) (o y:м) (e b q:н) (A:Dense.F.A8) (a:о jJ) (l:qа+bаbY d o y (eа+r) (A.f r)) (min k bа) 0 qа a)=pl (λr=>bY d o y (eа+r) (A.f r)) (min (k+1) bа) 0 qа a:=by subst g;unfold ln;split<;>rename_i h<;>simp only[β] at h .rw[dj,Dense.ac А,dN,j,(А:min (k+1) bа=min k bа+1),fx _ _ _ _ _ _ rfl А,(А:min k bа=k)] .rw[(А:min (k+1) bа=min k bа)] lemma fm (a:о jJ) (u:н) (v:jJ) (h:uаbY d o y (gа+r) (A.f r)) (min 8 bа) 0 qа a:=by unfold aV;split .rename_i h;obtain ⟨l,u,v⟩:=h have:=ε;have m:=Α.mp l;simp only[jH] at m;have e:∀k:н,kа<8->(q+k)а=qа+kа:=λk x=>Dense.ac А rw[(А:min 8 bа=8)] iterate 8 rw[fm] rw[e 1 (by simp only[jH];omega),e 2 (by simp only[jH];omega), e 3 (by simp only[jH];omega),e 4 (by simp only[jH];omega), e 5 (by simp only[jH];omega),e 6 (by simp only[jH];omega), e 7 (by simp only[jH];omega)] simp only[jH];iterate 8 rw[pl,AD А] rw[pl,AB А];simp only[dN,ό,ϩ,jY];rfl have L:=jr d o y g b q A a p;have j:=L 0 0 (by simp only[jH]) A.a0 rfl rw[Nat.zero_min,pl,AB А] at j;unfold gY simp only[j,L 1 1 (by simp only[jH]) A.a1 rfl,L 2 2 (by simp only[jH]) A.a2 rfl, L 3 3 (by simp only[jH]) A.a3 rfl,L 4 4 (by simp only[jH]) A.a4 rfl, L 5 5 (by simp only[jH]) A.a5 rfl,L 6 6 (by simp only[jH]) A.a6 rfl, L 7 7 (by simp only[jH]) A.a7 rfl,jY] lemma l0 (b:н) (h:0 м-> м-> н-> н-> н-> Dense.F.A8-> о п-> о п) (Wz X:@& FloatArray) (Tz:@& о м) (wo n:н) (M:м) (hs:Xе<2^32/\Wzе<2^32) (hn:nа<= Tzг) (hT:∀t о п:=id λa0 a1 a2 a3 a4 a5 a6 a7=> if h:t м-> м-> н-> н-> н-> Dense.F.A8-> о jJ-> о jJ) (e X:FloatArray) (b:о м) (g n:н) (M:м) (L:Xе<2^32/\eе<2^32) (Z:nа<= bг) (J:∀tX.data[iа+b[s]!+r]!*e.data[gа+s]!) nа tа (Dense.F.A8.f ⟨j,l,p,u,v,x,B,D⟩ r)): dB W e X b g n M L Z J Y i K d o y R O q a t j l p u v x B D=W d o y R O q A a:=by induction m generalizing t j l p u v x B D A with | zero=> rw[dB];dsimp only[id];rw[AI λh=>by have:=β.mp h;omega];congr 1 exact jk _ _ λr G=>by rw[H r G,b8 _ _ _ _ А] | succ m ih=> have h:t(i+(b.uget t А)д+c)а=iа+b[tа]!+cа:=λc hc=>by rw[d0,Dense.ac (by rw[I];omega),I] rw[dB];dsimp only[id];rw[AL h];refine ih (t+1) _ _ _ _ _ _ _ _ A (by rw[Dense.ae h];omega) λr G=>?_ rw[H r G,az _ _ _ _ N,Dense.ae h];congr 1;interval_cases r<;>simp (disch:=(try simp only[AC]);omega) only[Dense.F.A8.f,Dense.F.ug,rx,Dense.ac (by omega:g.toNat+t.toNatd.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+xb+ c.Tz[t]!+r]!*c.Wz.data[c.wo+t]!) c.n 0 (Dense.F.dw oneW*Dense.F.dw d.b[o]!) @[inline] def f7 (W:CD-> м-> м-> н-> н-> н-> Dense.F.A8-> о п-> о п) (d:@& CD) (c:@& CC d.M) (o y:м) (xb nq q i:н) (hi:iа+d.M+8<= d.Xе) (bp:р) (a:о п):о п:= dB W c.Wz d.X c.Tz c.woд c.nд d.M ⟨d.hX,c.h5⟩ (by have:=ε;have:=c.h3;rw[Dense.aa А];exact c.h1) (by have:=ε;have:=c.h3;rw[Dense.aa А];exact c.h4) (by have:=ε;have:=c.h3;rw[Dense.aa А,Dense.aa А];exact c.h2) i hi d o y xb nq q a 0 bp bp bp bp bp bp bp bp lemma f9 (d:CD) (c:CC d.M) (o y:м) (e m q i:н) (p:iа+d.M+8<= d.Xе) (l:р) (a:о jJ) (j:iа=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+eа) (g:l=Dense.F.dw jR*Dense.F.dw d.b[o]!):f7 aV d c o y e m q i p l a=aV d o y e m q (eY (dV d c o y eа)) a:=by subst g;unfold f7;have:=c.h3;refine gh _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ rfl λr u=>?_;simp only[eZ _ _ u,dV,j,aa c.wo А,aa c.n А,ρ,Dense.F.f8] @[specialize] def rB (W:CD-> м-> м-> н-> н-> н-> Dense.F.A8-> о п-> о п) (d:@& CD) (c:@& CC d.M) (o y:м) (xb nq q i:н) (bp:р) (a:о п) (hI:iа+nqа+d.M+7<= d.Xе):о п:= if h:0 jJ) (u:∀g r x,g+r=x-> r<8-> x bY d o y x (dV d c o y g r)=F x):∀m (g e q i:н) (a:о jJ) (v:iа+eа+d.M+7<= d.Xе),eа<= m-> gа+eа=d.s.w-> iа=(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+gа-> qа+eа<= aг-> aг<2^32->(rB aV d c o y g e q i p a v)г=aг /\ ∀jintro g e q i a v hm hx R hq O<;>by_cases h:0?_⟩;rw[G j B];rotate_left have N:=l8 e l;rw[AL l];have I:=u8 g А;have J:=u8 q А;have K:=s8 e l;have Y:=u8 i А;obtain ⟨s1,L⟩:=U (g+8) (e-8) (q+8) (i+8) _ _ А А А А (H.trans_lt O);refine ⟨А,λj B=>?_⟩;rw[L j А,G j B,I,J,K] all_goals split_ifs<;>first | rfl | omega | (congr 1;omega) | (rw[eZ _ _ А];exact u _ _ _ rfl А А) all_goals rw[rB,AI h];simp[β] at h;exact ⟨rfl,λj _=>by rw[AB А]⟩ @[specialize] def cx (h len:м) (V:н) (i0:м) (hN:i0+h*Vа y(q:м)->(i:н)-> iа=i0+y*Vа-> о п-> о п) (y q:м) (i:н) (hi:iа=i0+y*Vа) (a:о п):о п:= if hy:y y(q:м)->(i:н)-> iа=l+y*Vа-> о jJ-> о jJ) (r N:м) (G:м-> jJ) (A:∀y (g:y aг=N->(f y g q i e a)г=aг /\ ∀j y<= h-> q=r+y*b-> aг=N->(cx h b V l u f y q i e a)г=aг /\ ∀j intro y q i e a D g p _;obtain rfl:y=h:=А;rw[cx,AI А];exact ⟨rfl,λj _=>by rw[AB А]⟩ | succ m F=> intro y q i e a D _ p o;have g:yby rw[x j А,v j B];split_ifs<;>first | rfl | omega⟩ @[specialize] def dO (W:CD-> м-> м-> н-> н-> н-> Dense.F.A8-> о п-> о п) (d:@& CD) (c:@& CC d.M) (o q:м) (bp:р) (a:о п):о п:= let V:=d.s.w+2 let i0:=(if d.D then o else 0)*((d.s.h+2)*V) if hb:i0+(d.s.h-1)*V+d.s.w+d.M+7<= d.Xе then cx d.s.h d.s.w Vд i0 (by have:=d.hX;have:=ε;have:=Nat.sub_one_mul d.s.h V;have hV:V=d.s.w+2:=rfl;rw[Dense.aa А];omega) (λy hy q i hi a=>rB W d c o y 0 d.s.wд qд i bp a (by have:=d.hX;have:=ε;have:=ζ V (Nat.le_sub_one_of_lt hy) have hV:V=d.s.w+2:=rfl;rw[Dense.aa А] at hi;rw[Dense.aa А];omega)) 0 q i0д (by have:=d.hX;have:=ε;rw[Dense.aa А];simp) a else a lemma gE (d:CD) (c:CC d.M) (o q:м) (l:р) (a:о jJ) (N:м) (G:м-> jJ) (m:∀y g=q+y*d.s.w-> bг=N->(rB aV d c o y 0 d.s.wд gд i l b u)г=bг /\ ∀j(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+7<= d.Xе):(dO aV d c o q l a)г=aг /\ ∀jm y F g i b _ (by rw[A,Dense.aa B]) r p) _ 0 q _ _ a rfl (ϱ _) (by simp) v .rw[AI e,Nat.eq_zero_of_not_pos (mt x e)];exact ⟨rfl,λj _=>by rw[ϖ,ό,AB А]⟩ lemma eE (A:о м) (i:н) (v:м) (h:iаsimp[*,AF] def cS (K:о п) (T:о м) (M:м) (ok k:н) (hK:okа+kа<= Kг/\Kг<2^32) (hT:∀t(Tz:о м)->(Wz:FloatArray) -> Tzг=kа/\Wzе=kа-> cа<= tа/\tа<= kа->(∀j CC M:=id λc Tz Wz hs hc hz=> if h:tby rw[Dense.ae hc'] at hj;rw[eE _ _ _ _ _ А];split .rw[d0];exact hT _ ht .exact hz j А) else ⟨Tz,Wz,0,cа,А,А,А,hz,А⟩ termination_by kа-tа decreasing_by all_goals (have:=β.mp h;rw[Dense.ae h];omega) def NZ (K:о п) (T:о м) (ok t c:м) (Tz:о м) (Wz:FloatArray):у:= c<= t /\ ∃ix:м-> м, (∀j ℝ,(∀s z s=0)-> ∑j∈range c,z (ix j)=∑s∈range t,z s lemma en (K:о jJ) (T:о м) (M:м) (e k:н) (l:eа+kа<= Kг/\Kг<2^32) (G:∀t kа-tа=m-> NZ K T eа tа cа Tz Wz-> C.Tzг=kа/\C.Wzе=kа/\C.wo=0/\NZ K T eа kа C.n C.Tz C.Wz:=by intro m;induction m with | zero=>rintro t c Tz Wz hs hc hz _ rfl I h;rw[cS];dsimp only[id];rw[AI (by rw[β];omega)];rw[(А:tа=kа)] at h;exact ⟨hs.1,hs.2,rfl,h⟩ | succ m B=> rintro t c Tz Wz hs hc hz _ rfl I ⟨H,D,o,b⟩;have g:t(o j p).imp (λ_=>А) id,λz h=>by rw[v,Λ,h tа А A,add_zero];exact b z λs _ g=>h s А g⟩ .refine B (t+1) (c+1) _ _ _ _ _ _ rfl А ⟨А,λj=>if j?_,λz u=>?_⟩ .rw[eE _ _ _ _ _ А,da _ _ _ _ _ А];dsimp only;split_ifs<;>first | omega | exact (o j ‹_›).imp (λ_=>А) id | exact ⟨А,d0 ..,by rw[x]⟩ .rw[F,v,Λ,Λ,<- b z λs _ h=>u s А h];dsimp only;rw[AB (AU _)];congr 1;exact ϧ rfl λj p=>by rw[AD (mr p)] lemma dM (d:CD) (o:м) (e:oby simp at hj) abbrev CP (d:CD) (c:CC d.M) (o:м):у:= c.Wzе<2^32 /\ ∃ix:м-> м,c.n<= d.k /\ (∀j ℝ,(∀s z s=0)-> ∑j∈range c.n,z (ix j)=∑s∈range d.k,z s lemma gy (d:CD) (A:∀tby simp at D,λz _=>rfl⟩;simp only[v,x] at l m g e b;exact ⟨l,m,c.h5,G,g,by simpa[q] using e,b⟩ def cP (d:CD) (Z:т) (Wd:FloatArray) (hT:∀t bе<2^32 /\ ∀q⟨v,rfl,(e rfl).2 (o*d.k+j) А⟩,λz _=>rfl⟩ .unfold cP;rw[AL rfl];exact (gy _ _ _ _ _ _ _ _ _ _ rfl).2.2 namespace CG @[inline] def fz (af:п-> п) (d:@& CD) (lo sp:Д) (o:м) (y x:н) (S:р):п:= Fac.fA af lo sp S λ_=>ow d o yа xа S @[inline] def ws (a:о п) (i:н) (v:Unit-> п) (c:т) (h:c=true-> iа jJ) (c:т) (h):(ws a i v c h)г=aг:=by unfold ws;split<;>simp lemma gV (a:о jJ) (i:н) (v:Unit-> jJ) (c:т) (h) (j:м): (ws a i v c h)[j]! =if c=true/\j=iа then v () else a[j]!:=by unfold ws;split .rename_i b;rw[fm];by_cases e:j=iа .subst e;rw[Ϭ _ _ _ (h b),AD ⟨b,rfl⟩] .rw[ϴ _ _ _ _ (Ne.symm e),AB λg=>e g.2] .rename_i b;rw[AB λg=>b g.1] def RW (G:м-> п) (R:м-> у) [DecidablePred R] (a b:о п):у:= bг=aг /\ ∀j jJ} {e g:м-> у} [DecidablePred e] [DecidablePred g] {a b c:о jJ} (l:RW G e a b) (m:RW G g b c):RW G (λj=>e j\/g j) a c:= ⟨m.1.trans l.1,λj o=>by rw[m.2 j (l.1 ▸ o),l.2 j o];by_cases g j<;>by_cases e j<;>simp[*]⟩ lemma RW.jA {G:м-> jJ} {e g:м-> у} [DecidablePred e] [DecidablePred g] {a b c:о jJ} (m:RW G g b c) (l:RW G e a b):RW G (λj=>e j\/g j) a c:=RW.tr l m lemma RW.cg {G:м-> jJ} {R g:м-> у} [DecidablePred R] [DecidablePred g] {a b:о jJ} (h:RW G R a b) (e:∀j,R j↔g j):RW G g a b:= ⟨h.1,λj l=>by rw[h.2 j l];exact if_congr (e j) rfl rfl⟩ lemma RW.fc (G:м-> jJ) (b N:м) (a:о jJ):RW G (λj=>b<= j/\jby rw[AB А]⟩ lemma jF {G:м-> jJ} {g N k:м} {a b:о jJ} {i:н} {v:Unit-> jJ} {c:т} {h} (p:c=decide (k iа=g+k) (u:k v ()=G (g+k)) (o:RW G (λj=>g<= j/\jg<= j/\j?_⟩ rw[gV,o.2 j r,p];by_cases l:ke m.2];split_ifs<;>first | rfl | omega .rw[AB λm=>l (of_decide_eq_true m.1)];split_ifs<;>first | rfl | omega def ZB (X Wz:FloatArray) (Tz:о м) (n wo ib:н) (E:м):у:= nа<= Tzг/\woа+nа<= Wzе/\Wzе<2^32/\Xе<2^32 /\ ∀t п) (c:т) (h:c=true-> iаNat.lt_of_lt_of_eq (h hc) a.2.symm,(cV ..).trans a.2⟩ lemma ai {G:м-> jJ} {e N k M:м} {a:о jJ} {b:{a:о jJ // aг=M}} {i:н} {v:Unit-> jJ} {c:т} {h} (l:c=decide (k iа=e+k) (o:k v ()=G (e+k)) (g:RW G (λj=>e<= j/\je<= j/\j?_⟩ rw[g] at j;rw[uC p А];have:=x (q+1) А;rw[Θ] at this;omega def cf (p:м-> м-> р) (nc c:м) (a:р):р:= if c м-> р) (b c:м) (a:р) (h:c м-> р) (b c:м) (a:р) (h:¬c п) (d:@& CD) (lo sp:Д) (o:м) (x0 wb y ob:н) (a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р) (out:о п) (ho:obа+wbа<= outг/\0fz af d lo sp o (y+0) (x0+0) a0) true (λ_=>aj ho 0 ho.2.1)) (ob+1) (λ_=>fz af d lo sp o (y+0) (x0+1) a1) (1aj ho 1 (eD hc))) (ob+2) (λ_=>fz af d lo sp o (y+0) (x0+2) a2) (2aj ho 2 (eD hc))) (ob+3) (λ_=>fz af d lo sp o (y+0) (x0+3) a3) (3aj ho 3 (eD hc))) (ob+4) (λ_=>fz af d lo sp o (y+0) (x0+4) a4) (4aj ho 4 (eD hc))) (ob+5) (λ_=>fz af d lo sp o (y+0) (x0+5) a5) (5aj ho 5 (eD hc))) (ob+6) (λ_=>fz af d lo sp o (y+0) (x0+6) a6) (6aj ho 6 (eD hc))) (ob+7) (λ_=>fz af d lo sp o (y+0) (x0+7) a7) (7aj ho 7 (eD hc))) (ob+8) (λ_=>fz af d lo sp o (y+0) (x0+8) a8) (8aj ho 8 (eD hc))) (ob+9) (λ_=>fz af d lo sp o (y+0) (x0+9) a9) (9aj ho 9 (eD hc))) (ob+10) (λ_=>fz af d lo sp o (y+0) (x0+10) a10) (10aj ho 10 (eD hc))) (ob+11) (λ_=>fz af d lo sp o (y+0) (x0+11) a11) (11aj ho 11 (eD hc))) (ob+12) (λ_=>fz af d lo sp o (y+0) (x0+12) a12) (12aj ho 12 (eD hc))) (ob+13) (λ_=>fz af d lo sp o (y+0) (x0+13) a13) (13aj ho 13 (eD hc))) (ob+14) (λ_=>fz af d lo sp o (y+0) (x0+14) a14) (14aj ho 14 (eD hc))) (ob+15) (λ_=>fz af d lo sp o (y+0) (x0+15) a15) (15aj ho 15 (eD hc))).1 @[noinline,specialize] def x1 (af:п-> п) (d:@& CD) (lo sp:Д) (o:м) (x0 wb y ob:н) (a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р) (out:о п) (ho:obа+wbа<= outг/\0 jJ) (d:CD) (r u:Д) (o:м) (v l y g:н) (A:м-> р) (m:о jJ) (q:gа+lа<= mг/\0 jJ) (b:∀k:м,k fz p d r u o (y+0) (v+kд) (A k)=G (gа+k)): RW G (λj=>gа<= j/\jeo g 15 А) (λe=>b 15 e) (ai (ec l 14 Б) (λ_=>eo g 14 А) (λe=>b 14 e) (ai (ec l 13 Б) (λ_=>eo g 13 А) (λe=>b 13 e) (ai (ec l 12 Б) (λ_=>eo g 12 А) (λe=>b 12 e) (ai (ec l 11 Б) (λ_=>eo g 11 А) (λe=>b 11 e) (ai (ec l 10 Б) (λ_=>eo g 10 А) (λe=>b 10 e) (ai (ec l 9 Б) (λ_=>eo g 9 А) (λe=>b 9 e) (ai (ec l 8 Б) (λ_=>eo g 8 А) (λe=>b 8 e) (ai (ec l 7 Б) (λ_=>eo g 7 А) (λe=>b 7 e) (ai (ec l 6 Б) (λ_=>eo g 6 А) (λe=>b 6 e) (ai (ec l 5 Б) (λ_=>eo g 5 А) (λe=>b 5 e) (ai (ec l 4 Б) (λ_=>eo g 4 А) (λe=>b 4 e) (ai (ec l 3 Б) (λ_=>eo g 3 А) (λe=>b 3 e) (ai (ec l 2 Б) (λ_=>eo g 2 А) (λe=>b 2 e) (ai (ec l 1 Б) (λ_=>eo g 1 А) (λe=>b 1 e) (ai (AX q.2.1).symm (λ_=>eo g 0 А) (λe=>b 0 e) (RW.fc G _ _ m))))))))))))))))) λj=>А @[inline] def e2 (af:п-> п) (d:@& CD) (lo sp:Д) (o:м) (Wo x0 wb y ob:н) (a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р) (out:о п) (ho:obа+Woа+wbа<= outг/\0fz af d lo sp o (y+0) (x0+0) a0) true (λ_=>bc ho 0 ho.2.1)) (ob+1) (λ_=>fz af d lo sp o (y+0) (x0+1) a1) (1bc ho 1 (eD hc))) (ob+2) (λ_=>fz af d lo sp o (y+0) (x0+2) a2) (2bc ho 2 (eD hc))) (ob+3) (λ_=>fz af d lo sp o (y+0) (x0+3) a3) (3bc ho 3 (eD hc))) (ob+4) (λ_=>fz af d lo sp o (y+0) (x0+4) a4) (4bc ho 4 (eD hc))) (ob+5) (λ_=>fz af d lo sp o (y+0) (x0+5) a5) (5bc ho 5 (eD hc))) (ob+6) (λ_=>fz af d lo sp o (y+0) (x0+6) a6) (6bc ho 6 (eD hc))) (ob+7) (λ_=>fz af d lo sp o (y+0) (x0+7) a7) (7bc ho 7 (eD hc))) (ob+Wo+0) (λ_=>fz af d lo sp o (y+1) (x0+0) a8) true (λ_=>bd ho 0 ho.2.1)) (ob+Wo+1) (λ_=>fz af d lo sp o (y+1) (x0+1) a9) (1bd ho 1 (eD hc))) (ob+Wo+2) (λ_=>fz af d lo sp o (y+1) (x0+2) a10) (2bd ho 2 (eD hc))) (ob+Wo+3) (λ_=>fz af d lo sp o (y+1) (x0+3) a11) (3bd ho 3 (eD hc))) (ob+Wo+4) (λ_=>fz af d lo sp o (y+1) (x0+4) a12) (4bd ho 4 (eD hc))) (ob+Wo+5) (λ_=>fz af d lo sp o (y+1) (x0+5) a13) (5bd ho 5 (eD hc))) (ob+Wo+6) (λ_=>fz af d lo sp o (y+1) (x0+6) a14) (6bd ho 6 (eD hc))) (ob+Wo+7) (λ_=>fz af d lo sp o (y+1) (x0+7) a15) (7bd ho 7 (eD hc))).1 @[noinline,specialize] def x2 (af:п-> п) (d:@& CD) (lo sp:Д) (o:м) (Wo x0 wb y ob:н) (a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р) (out:о п) (ho:obа+Woа+wbа<= outг/\0 jJ) (d:CD) (v x:Д) (o:м) (p D g y e:н) (A B:м-> р) (q:о jJ) (u:eа+pа+gа<= qг/\0 jJ) (l:∀k:м,k fz r d v x o (y+0) (D+kд) (A k)=G (eа+k)) (m:∀k:м,k fz r d v x o (y+1) (D+kд) (B k)=G (eа+pа+k)): RW G (λj=>(eа<= j/\jbV e p 7 А) (λb=>m 7 b) (ai (ec g 6 Б) (λ_=>bV e p 6 А) (λb=>m 6 b) (ai (ec g 5 Б) (λ_=>bV e p 5 А) (λb=>m 5 b) (ai (ec g 4 Б) (λ_=>bV e p 4 А) (λb=>m 4 b) (ai (ec g 3 Б) (λ_=>bV e p 3 А) (λb=>m 3 b) (ai (ec g 2 Б) (λ_=>bV e p 2 А) (λb=>m 2 b) (ai (ec g 1 Б) (λ_=>bV e p 1 А) (λb=>m 1 b) (ai (AX u.2.1).symm (λ_=>bV e p 0 А) (λb=>m 0 b) (RW.fc G _ _ _))))))))) (ai (ec g 7 Б) (λ_=>eo e 7 А) (λb=>l 7 b) (ai (ec g 6 Б) (λ_=>eo e 6 А) (λb=>l 6 b) (ai (ec g 5 Б) (λ_=>eo e 5 А) (λb=>l 5 b) (ai (ec g 4 Б) (λ_=>eo e 4 А) (λb=>l 4 b) (ai (ec g 3 Б) (λ_=>eo e 3 А) (λb=>l 3 b) (ai (ec g 2 Б) (λ_=>eo e 2 А) (λb=>l 2 b) (ai (ec g 1 Б) (λ_=>eo e 1 А) (λb=>l 1 b) (ai (AX u.2.1).symm (λ_=>eo e 0 А) (λb=>l 0 b) (RW.fc G _ _ q)))))))))) λj=>А @[specialize] def t1 (af:п-> п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (x0 wb n wo y ib ob:н) (hz:ZB X Wz Tz n wo ib (16)) (t:н):(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+wbа<= outг/\0 о п:=id λa0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:t jJ) (d:CD) (Z sp:Д) (X e:FloatArray) (b:о м) (o:м) (x0 A n j y g O:н) (Y:ZB X e b n j g (16)) (x:о jJ) (U:Oа+Aа<= xг/\0 t1 R d Z sp X e b o x0 A n j y g O Y t B D G H I J K L M N l p q r u v x U= e1 R d Z sp o x0 A y O (Dense.F.ab (CP X e b j (gа+0)) nа tа B) (Dense.F.ab (CP X e b j (gа+1)) nа tа D) (Dense.F.ab (CP X e b j (gа+2)) nа tа G) (Dense.F.ab (CP X e b j (gа+3)) nа tа H) (Dense.F.ab (CP X e b j (gа+4)) nа tа I) (Dense.F.ab (CP X e b j (gа+5)) nа tа J) (Dense.F.ab (CP X e b j (gа+6)) nа tа K) (Dense.F.ab (CP X e b j (gа+7)) nа tа L) (Dense.F.ab (CP X e b j (gа+8)) nа tа M) (Dense.F.ab (CP X e b j (gа+9)) nа tа N) (Dense.F.ab (CP X e b j (gа+10)) nа tа l) (Dense.F.ab (CP X e b j (gа+11)) nа tа p) (Dense.F.ab (CP X e b j (gа+12)) nа tа q) (Dense.F.ab (CP X e b j (gа+13)) nа tа r) (Dense.F.ab (CP X e b j (gа+14)) nа tа u) (Dense.F.ab (CP X e b j (gа+15)) nа tа v) x U:=by intro m;induction m with | zero=> intro t B D G H I J K L M N l p q r u v h1;rw[t1];dsimp only[id];rw[AI (by rw[β];omega)] simp only[b8 _ _ _ _ (by omega:¬t.toNat intro t B D G H I J K L M N l p q r u v h1;have h:t п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (x0 wb n wo y ib ob:н) (hz:ZB X Wz Tz n wo ib (16)) (t:н):(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+wbа<= outг/\0 о п:=id λa0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:t jJ) (d:CD) (lo sp:Д) (X g:FloatArray) (b:о м) (o:м) (x0 D n l y j Y:н) (B:ZB X g b n l j (16)) (A:о jJ) (ho:Yа+Dа<= Aг/\0 cB Z d lo sp X g b o x0 D n l y j Y B t G H I J K L M N O R p q r u v x A ho= e1 Z d lo sp o x0 D y Y (Dense.F.ab (CP X g b l (jа+0)) nа tа G) (Dense.F.ab (CP X g b l (jа+1)) nа tа H) (Dense.F.ab (CP X g b l (jа+2)) nа tа I) (Dense.F.ab (CP X g b l (jа+3)) nа tа J) (Dense.F.ab (CP X g b l (jа+4)) nа tа K) (Dense.F.ab (CP X g b l (jа+5)) nа tа L) (Dense.F.ab (CP X g b l (jа+6)) nа tа M) (Dense.F.ab (CP X g b l (jа+7)) nа tа N) (Dense.F.ab (CP X g b l (jа+8)) nа tа O) (Dense.F.ab (CP X g b l (jа+9)) nа tа R) (Dense.F.ab (CP X g b l (jа+10)) nа tа p) (Dense.F.ab (CP X g b l (jа+11)) nа tа q) (Dense.F.ab (CP X g b l (jа+12)) nа tа r) (Dense.F.ab (CP X g b l (jа+13)) nа tа u) (Dense.F.ab (CP X g b l (jа+14)) nа tа v) (Dense.F.ab (CP X g b l (jа+15)) nа tа x) A ho:=by intro m;induction m with | zero=> intro t G H I J K L M N O R p q r u v x h1;rw[cB];dsimp only[id];rw[AI (by rw[β];omega)];unfold x1 simp only[b8 _ _ _ _ (by omega:¬t.toNat intro t G H I J K L M N O R p q r u v x h1;by_cases h:t п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V Wo x0 wb n wo y ib ob:н) (hz:ZB X Wz Tz n wo ib (Vа+8)) (t:н):(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+Woа+wbа<= outг/\0 о п:=id λa0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:t jJ) (d:CD) (lo sp:Д) (X e:FloatArray) (b:о м) (o:м) (V O x0 A n j y g R:н) (Z:ZB X e b n j g (Vа+8)) (x:о jJ) (Y:Rа+Oа+Aа<= xг/\0 t2 U d lo sp X e b o V O x0 A n j y g R Z t B D G H I J K L M N l p q r u v x Y= e2 U d lo sp o O x0 A y R (Dense.F.ab (CP X e b j (gа+0)) nа tа B) (Dense.F.ab (CP X e b j (gа+1)) nа tа D) (Dense.F.ab (CP X e b j (gа+2)) nа tа G) (Dense.F.ab (CP X e b j (gа+3)) nа tа H) (Dense.F.ab (CP X e b j (gа+4)) nа tа I) (Dense.F.ab (CP X e b j (gа+5)) nа tа J) (Dense.F.ab (CP X e b j (gа+6)) nа tа K) (Dense.F.ab (CP X e b j (gа+7)) nа tа L) (Dense.F.ab (CP X e b j (gа+(Vа+0))) nа tа M) (Dense.F.ab (CP X e b j (gа+(Vа+1))) nа tа N) (Dense.F.ab (CP X e b j (gа+(Vа+2))) nа tа l) (Dense.F.ab (CP X e b j (gа+(Vа+3))) nа tа p) (Dense.F.ab (CP X e b j (gа+(Vа+4))) nа tа q) (Dense.F.ab (CP X e b j (gа+(Vа+5))) nа tа r) (Dense.F.ab (CP X e b j (gа+(Vа+6))) nа tа u) (Dense.F.ab (CP X e b j (gа+(Vа+7))) nа tа v) x Y:=by intro m;induction m with | zero=> intro t B D G H I J K L M N l p q r u v h1;rw[t2];dsimp only[id];rw[AI (by rw[β];omega)] simp only[b8 _ _ _ _ (by omega:¬t.toNat intro t B D G H I J K L M N l p q r u v h1;have h:t п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V Wo x0 wb n wo y ib ob:н) (hz:ZB X Wz Tz n wo ib (Vа+8)) (t:н):(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+Woа+wbа<= outг/\0 о п:=id λa0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:t jJ) (d:CD) (lo sp:Д) (X g:FloatArray) (b:о м) (o:м) (V Y x0 D n l y j Z:н) (B:ZB X g b n l j (Vа+8)) (A:о jJ) (ho:Zа+Yа+Dа<= Aг/\0 cC af d lo sp X g b o V Y x0 D n l y j Z B t G H I J K L M N O R p q r u v x A ho= e2 af d lo sp o Y x0 D y Z (Dense.F.ab (CP X g b l (jа+0)) nа tа G) (Dense.F.ab (CP X g b l (jа+1)) nа tа H) (Dense.F.ab (CP X g b l (jа+2)) nа tа I) (Dense.F.ab (CP X g b l (jа+3)) nа tа J) (Dense.F.ab (CP X g b l (jа+4)) nа tа K) (Dense.F.ab (CP X g b l (jа+5)) nа tа L) (Dense.F.ab (CP X g b l (jа+6)) nа tа M) (Dense.F.ab (CP X g b l (jа+7)) nа tа N) (Dense.F.ab (CP X g b l (jа+(Vа+0))) nа tа O) (Dense.F.ab (CP X g b l (jа+(Vа+1))) nа tа R) (Dense.F.ab (CP X g b l (jа+(Vа+2))) nа tа p) (Dense.F.ab (CP X g b l (jа+(Vа+3))) nа tа q) (Dense.F.ab (CP X g b l (jа+(Vа+4))) nа tа r) (Dense.F.ab (CP X g b l (jа+(Vа+5))) nа tа u) (Dense.F.ab (CP X g b l (jа+(Vа+6))) nа tа v) (Dense.F.ab (CP X g b l (jа+(Vа+7))) nа tа x) A ho:=by intro m;induction m with | zero=> intro t G H I J K L M N O R p q r u v x h1;rw[cC];dsimp only[id];rw[AI (by rw[β];omega)];unfold x2 simp only[b8 _ _ _ _ (by omega:¬t.toNat intro t G H I J K L M N O R p q r u v x h1;by_cases h:t р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> о п):о п:= let w0:=wg hu h 0 let w1:=wg hu h 1 let w2:=wg hu h 2 let w3:=wg hu h 3 let w4:=wg hu h 4 let w5:=wg hu h 5 let w6:=wg hu h 6 let w7:=wg hu h 7 let w8:=wg hu h 8 let x0_0:=xg hu h 0 0 let a0:=a0+x0_0*w0 let x0_1:=xg hu h 0 1 let a1:=a1+x0_1*w0 let x0_2:=xg hu h 0 2 let a2:=a2+x0_2*w0 let x0_3:=xg hu h 0 3 let a3:=a3+x0_3*w0 let x0_4:=xg hu h 0 4 let a4:=a4+x0_4*w0 let x0_5:=xg hu h 0 5 let a5:=a5+x0_5*w0 let x0_6:=xg hu h 0 6 let a6:=a6+x0_6*w0 let x0_7:=xg hu h 0 7 let a7:=a7+x0_7*w0 let x0_8:=xg hu h 0 8 let a8:=a8+x0_8*w0 let x0_9:=xg hu h 0 9 let a9:=a9+x0_9*w0 let x0_10:=xg hu h 0 10 let a10:=a10+x0_10*w0 let x0_11:=xg hu h 0 11 let a11:=a11+x0_11*w0 let x0_12:=xg hu h 0 12 let a12:=a12+x0_12*w0 let x0_13:=xg hu h 0 13 let a13:=a13+x0_13*w0 let x0_14:=xg hu h 0 14 let a14:=a14+x0_14*w0 let x0_15:=xg hu h 0 15 let a15:=a15+x0_15*w0 let a0:=a0+x0_1*w1 let a1:=a1+x0_2*w1 let a2:=a2+x0_3*w1 let a3:=a3+x0_4*w1 let a4:=a4+x0_5*w1 let a5:=a5+x0_6*w1 let a6:=a6+x0_7*w1 let a7:=a7+x0_8*w1 let a8:=a8+x0_9*w1 let a9:=a9+x0_10*w1 let a10:=a10+x0_11*w1 let a11:=a11+x0_12*w1 let a12:=a12+x0_13*w1 let a13:=a13+x0_14*w1 let a14:=a14+x0_15*w1 let x0_16:=xg hu h 0 16 let a15:=a15+x0_16*w1 let a0:=a0+x0_2*w2 let a1:=a1+x0_3*w2 let a2:=a2+x0_4*w2 let a3:=a3+x0_5*w2 let a4:=a4+x0_6*w2 let a5:=a5+x0_7*w2 let a6:=a6+x0_8*w2 let a7:=a7+x0_9*w2 let a8:=a8+x0_10*w2 let a9:=a9+x0_11*w2 let a10:=a10+x0_12*w2 let a11:=a11+x0_13*w2 let a12:=a12+x0_14*w2 let a13:=a13+x0_15*w2 let a14:=a14+x0_16*w2 let x0_17:=xg hu h 0 17 let a15:=a15+x0_17*w2 let x1_0:=xg hu h 1 0 let a0:=a0+x1_0*w3 let x1_1:=xg hu h 1 1 let a1:=a1+x1_1*w3 let x1_2:=xg hu h 1 2 let a2:=a2+x1_2*w3 let x1_3:=xg hu h 1 3 let a3:=a3+x1_3*w3 let x1_4:=xg hu h 1 4 let a4:=a4+x1_4*w3 let x1_5:=xg hu h 1 5 let a5:=a5+x1_5*w3 let x1_6:=xg hu h 1 6 let a6:=a6+x1_6*w3 let x1_7:=xg hu h 1 7 let a7:=a7+x1_7*w3 let x1_8:=xg hu h 1 8 let a8:=a8+x1_8*w3 let x1_9:=xg hu h 1 9 let a9:=a9+x1_9*w3 let x1_10:=xg hu h 1 10 let a10:=a10+x1_10*w3 let x1_11:=xg hu h 1 11 let a11:=a11+x1_11*w3 let x1_12:=xg hu h 1 12 let a12:=a12+x1_12*w3 let x1_13:=xg hu h 1 13 let a13:=a13+x1_13*w3 let x1_14:=xg hu h 1 14 let a14:=a14+x1_14*w3 let x1_15:=xg hu h 1 15 let a15:=a15+x1_15*w3 let a0:=a0+x1_1*w4 let a1:=a1+x1_2*w4 let a2:=a2+x1_3*w4 let a3:=a3+x1_4*w4 let a4:=a4+x1_5*w4 let a5:=a5+x1_6*w4 let a6:=a6+x1_7*w4 let a7:=a7+x1_8*w4 let a8:=a8+x1_9*w4 let a9:=a9+x1_10*w4 let a10:=a10+x1_11*w4 let a11:=a11+x1_12*w4 let a12:=a12+x1_13*w4 let a13:=a13+x1_14*w4 let a14:=a14+x1_15*w4 let x1_16:=xg hu h 1 16 let a15:=a15+x1_16*w4 let a0:=a0+x1_2*w5 let a1:=a1+x1_3*w5 let a2:=a2+x1_4*w5 let a3:=a3+x1_5*w5 let a4:=a4+x1_6*w5 let a5:=a5+x1_7*w5 let a6:=a6+x1_8*w5 let a7:=a7+x1_9*w5 let a8:=a8+x1_10*w5 let a9:=a9+x1_11*w5 let a10:=a10+x1_12*w5 let a11:=a11+x1_13*w5 let a12:=a12+x1_14*w5 let a13:=a13+x1_15*w5 let a14:=a14+x1_16*w5 let x1_17:=xg hu h 1 17 let a15:=a15+x1_17*w5 let x2_0:=xg hu h 2 0 let a0:=a0+x2_0*w6 let x2_1:=xg hu h 2 1 let a1:=a1+x2_1*w6 let x2_2:=xg hu h 2 2 let a2:=a2+x2_2*w6 let x2_3:=xg hu h 2 3 let a3:=a3+x2_3*w6 let x2_4:=xg hu h 2 4 let a4:=a4+x2_4*w6 let x2_5:=xg hu h 2 5 let a5:=a5+x2_5*w6 let x2_6:=xg hu h 2 6 let a6:=a6+x2_6*w6 let x2_7:=xg hu h 2 7 let a7:=a7+x2_7*w6 let x2_8:=xg hu h 2 8 let a8:=a8+x2_8*w6 let x2_9:=xg hu h 2 9 let a9:=a9+x2_9*w6 let x2_10:=xg hu h 2 10 let a10:=a10+x2_10*w6 let x2_11:=xg hu h 2 11 let a11:=a11+x2_11*w6 let x2_12:=xg hu h 2 12 let a12:=a12+x2_12*w6 let x2_13:=xg hu h 2 13 let a13:=a13+x2_13*w6 let x2_14:=xg hu h 2 14 let a14:=a14+x2_14*w6 let x2_15:=xg hu h 2 15 let a15:=a15+x2_15*w6 let a0:=a0+x2_1*w7 let a1:=a1+x2_2*w7 let a2:=a2+x2_3*w7 let a3:=a3+x2_4*w7 let a4:=a4+x2_5*w7 let a5:=a5+x2_6*w7 let a6:=a6+x2_7*w7 let a7:=a7+x2_8*w7 let a8:=a8+x2_9*w7 let a9:=a9+x2_10*w7 let a10:=a10+x2_11*w7 let a11:=a11+x2_12*w7 let a12:=a12+x2_13*w7 let a13:=a13+x2_14*w7 let a14:=a14+x2_15*w7 let x2_16:=xg hu h 2 16 let a15:=a15+x2_16*w7 let a0:=a0+x2_2*w8 let a1:=a1+x2_3*w8 let a2:=a2+x2_4*w8 let a3:=a3+x2_5*w8 let a4:=a4+x2_6*w8 let a5:=a5+x2_7*w8 let a6:=a6+x2_8*w8 let a7:=a7+x2_9*w8 let a8:=a8+x2_10*w8 let a9:=a9+x2_11*w8 let a10:=a10+x2_12*w8 let a11:=a11+x2_13*w8 let a12:=a12+x2_14*w8 let a13:=a13+x2_15*w8 let a14:=a14+x2_16*w8 let x2_17:=xg hu h 2 17 let a15:=a15+x2_17*w8 k a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 @[specialize] def u1 (af:п-> п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (o:м) (V HV x0 wb nc y ob c:н): (cb wi:н)->(hu:UZ X Wz nc c cb wi HV V 2 17)->(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+wbа<= outг/\0 о п:=id λcb wi hu a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:c u1 af d lo sp X Wz o V HV x0 wb nc y ob (c+1) (cb+HV) (wi+9) (cT hu h) a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho else e1 af d lo sp o x0 wb y ob a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho termination_by ncа-cа decreasing_by have:=β.mp h;rw[Dense.ae h];omega lemma fk (af:jJ-> jJ) (d:CD) (lo sp:Д) (X g:FloatArray) (o:м) (V e x0 H b y Z:н) (B:о jJ) (ho:Zа+Hа<= Bг/\0(cа Dа=j+cа*eа) -> (cа Gа=l+9*cа) -> u1 af d lo sp X g o V e x0 H b y Z c D G A I J K L M N O R U Y p q r u v x B ho=e1 af d lo sp o x0 H y Z (cf (UL X g j l eа Vа 0 0) bа cа I) (cf (UL X g j l eа Vа 0 1) bа cа J) (cf (UL X g j l eа Vа 0 2) bа cа K) (cf (UL X g j l eа Vа 0 3) bа cа L) (cf (UL X g j l eа Vа 0 4) bа cа M) (cf (UL X g j l eа Vа 0 5) bа cа N) (cf (UL X g j l eа Vа 0 6) bа cа O) (cf (UL X g j l eа Vа 0 7) bа cа R) (cf (UL X g j l eа Vа 0 8) bа cа U) (cf (UL X g j l eа Vа 0 9) bа cа Y) (cf (UL X g j l eа Vа 0 10) bа cа p) (cf (UL X g j l eа Vа 0 11) bа cа q) (cf (UL X g j l eа Vа 0 12) bа cа r) (cf (UL X g j l eа Vа 0 13) bа cа u) (cf (UL X g j l eа Vа 0 14) bа cа v) (cf (UL X g j l eа Vа 0 15) bа cа x) B ho:=by intro m;induction m with | zero=> intro c D G A I J K L M N O R U Y p q r u v x h1 _ _;rw[u1];dsimp only[id];rw[AI (by rw[β];omega)] simp only[eM _ _ _ _ (by omega:¬c.toNat intro c D G A I J K L M N O R U Y p q r u v x h1 h2 h3;have F:cаby rw[Dense.ae h] at h4;rw[uC A h4,Dense.ae h,h2 F,Θ];omega) (λ_=>by rw[Dense.ac (by have:=A.2.1;have:=A.2.2.2.1;have:=ε;simp only[jH];omega),Dense.ae h,h3 F];simp only[jH];omega)] simp (disch:=simp) only[Dense.ae h,eP _ _ _ _ F,gR A h,gQ A h,h2 F,h3 F,UL, jH,jY,kB,jO] @[inline] def s2 (X Wz:@& FloatArray) (V HV nc c cb wi:н) (hu:UZ X Wz nc c cb wi HV V 3 9) (h:c р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> о п):о п:= let w0:=wg hu h 0 let w1:=wg hu h 1 let w2:=wg hu h 2 let w3:=wg hu h 3 let w4:=wg hu h 4 let w5:=wg hu h 5 let w6:=wg hu h 6 let w7:=wg hu h 7 let w8:=wg hu h 8 let x0_0:=xg hu h 0 0 let a0:=a0+x0_0*w0 let x0_1:=xg hu h 0 1 let a1:=a1+x0_1*w0 let x0_2:=xg hu h 0 2 let a2:=a2+x0_2*w0 let x0_3:=xg hu h 0 3 let a3:=a3+x0_3*w0 let x0_4:=xg hu h 0 4 let a4:=a4+x0_4*w0 let x0_5:=xg hu h 0 5 let a5:=a5+x0_5*w0 let x0_6:=xg hu h 0 6 let a6:=a6+x0_6*w0 let x0_7:=xg hu h 0 7 let a7:=a7+x0_7*w0 let x1_0:=xg hu h 1 0 let a8:=a8+x1_0*w0 let x1_1:=xg hu h 1 1 let a9:=a9+x1_1*w0 let x1_2:=xg hu h 1 2 let a10:=a10+x1_2*w0 let x1_3:=xg hu h 1 3 let a11:=a11+x1_3*w0 let x1_4:=xg hu h 1 4 let a12:=a12+x1_4*w0 let x1_5:=xg hu h 1 5 let a13:=a13+x1_5*w0 let x1_6:=xg hu h 1 6 let a14:=a14+x1_6*w0 let x1_7:=xg hu h 1 7 let a15:=a15+x1_7*w0 let a0:=a0+x0_1*w1 let a1:=a1+x0_2*w1 let a2:=a2+x0_3*w1 let a3:=a3+x0_4*w1 let a4:=a4+x0_5*w1 let a5:=a5+x0_6*w1 let a6:=a6+x0_7*w1 let x0_8:=xg hu h 0 8 let a7:=a7+x0_8*w1 let a8:=a8+x1_1*w1 let a9:=a9+x1_2*w1 let a10:=a10+x1_3*w1 let a11:=a11+x1_4*w1 let a12:=a12+x1_5*w1 let a13:=a13+x1_6*w1 let a14:=a14+x1_7*w1 let x1_8:=xg hu h 1 8 let a15:=a15+x1_8*w1 let a0:=a0+x0_2*w2 let a1:=a1+x0_3*w2 let a2:=a2+x0_4*w2 let a3:=a3+x0_5*w2 let a4:=a4+x0_6*w2 let a5:=a5+x0_7*w2 let a6:=a6+x0_8*w2 let x0_9:=xg hu h 0 9 let a7:=a7+x0_9*w2 let a8:=a8+x1_2*w2 let a9:=a9+x1_3*w2 let a10:=a10+x1_4*w2 let a11:=a11+x1_5*w2 let a12:=a12+x1_6*w2 let a13:=a13+x1_7*w2 let a14:=a14+x1_8*w2 let x1_9:=xg hu h 1 9 let a15:=a15+x1_9*w2 let a0:=a0+x1_0*w3 let a1:=a1+x1_1*w3 let a2:=a2+x1_2*w3 let a3:=a3+x1_3*w3 let a4:=a4+x1_4*w3 let a5:=a5+x1_5*w3 let a6:=a6+x1_6*w3 let a7:=a7+x1_7*w3 let x2_0:=xg hu h 2 0 let a8:=a8+x2_0*w3 let x2_1:=xg hu h 2 1 let a9:=a9+x2_1*w3 let x2_2:=xg hu h 2 2 let a10:=a10+x2_2*w3 let x2_3:=xg hu h 2 3 let a11:=a11+x2_3*w3 let x2_4:=xg hu h 2 4 let a12:=a12+x2_4*w3 let x2_5:=xg hu h 2 5 let a13:=a13+x2_5*w3 let x2_6:=xg hu h 2 6 let a14:=a14+x2_6*w3 let x2_7:=xg hu h 2 7 let a15:=a15+x2_7*w3 let a0:=a0+x1_1*w4 let a1:=a1+x1_2*w4 let a2:=a2+x1_3*w4 let a3:=a3+x1_4*w4 let a4:=a4+x1_5*w4 let a5:=a5+x1_6*w4 let a6:=a6+x1_7*w4 let a7:=a7+x1_8*w4 let a8:=a8+x2_1*w4 let a9:=a9+x2_2*w4 let a10:=a10+x2_3*w4 let a11:=a11+x2_4*w4 let a12:=a12+x2_5*w4 let a13:=a13+x2_6*w4 let a14:=a14+x2_7*w4 let x2_8:=xg hu h 2 8 let a15:=a15+x2_8*w4 let a0:=a0+x1_2*w5 let a1:=a1+x1_3*w5 let a2:=a2+x1_4*w5 let a3:=a3+x1_5*w5 let a4:=a4+x1_6*w5 let a5:=a5+x1_7*w5 let a6:=a6+x1_8*w5 let a7:=a7+x1_9*w5 let a8:=a8+x2_2*w5 let a9:=a9+x2_3*w5 let a10:=a10+x2_4*w5 let a11:=a11+x2_5*w5 let a12:=a12+x2_6*w5 let a13:=a13+x2_7*w5 let a14:=a14+x2_8*w5 let x2_9:=xg hu h 2 9 let a15:=a15+x2_9*w5 let a0:=a0+x2_0*w6 let a1:=a1+x2_1*w6 let a2:=a2+x2_2*w6 let a3:=a3+x2_3*w6 let a4:=a4+x2_4*w6 let a5:=a5+x2_5*w6 let a6:=a6+x2_6*w6 let a7:=a7+x2_7*w6 let x3_0:=xg hu h 3 0 let a8:=a8+x3_0*w6 let x3_1:=xg hu h 3 1 let a9:=a9+x3_1*w6 let x3_2:=xg hu h 3 2 let a10:=a10+x3_2*w6 let x3_3:=xg hu h 3 3 let a11:=a11+x3_3*w6 let x3_4:=xg hu h 3 4 let a12:=a12+x3_4*w6 let x3_5:=xg hu h 3 5 let a13:=a13+x3_5*w6 let x3_6:=xg hu h 3 6 let a14:=a14+x3_6*w6 let x3_7:=xg hu h 3 7 let a15:=a15+x3_7*w6 let a0:=a0+x2_1*w7 let a1:=a1+x2_2*w7 let a2:=a2+x2_3*w7 let a3:=a3+x2_4*w7 let a4:=a4+x2_5*w7 let a5:=a5+x2_6*w7 let a6:=a6+x2_7*w7 let a7:=a7+x2_8*w7 let a8:=a8+x3_1*w7 let a9:=a9+x3_2*w7 let a10:=a10+x3_3*w7 let a11:=a11+x3_4*w7 let a12:=a12+x3_5*w7 let a13:=a13+x3_6*w7 let a14:=a14+x3_7*w7 let x3_8:=xg hu h 3 8 let a15:=a15+x3_8*w7 let a0:=a0+x2_2*w8 let a1:=a1+x2_3*w8 let a2:=a2+x2_4*w8 let a3:=a3+x2_5*w8 let a4:=a4+x2_6*w8 let a5:=a5+x2_7*w8 let a6:=a6+x2_8*w8 let a7:=a7+x2_9*w8 let a8:=a8+x3_2*w8 let a9:=a9+x3_3*w8 let a10:=a10+x3_4*w8 let a11:=a11+x3_5*w8 let a12:=a12+x3_6*w8 let a13:=a13+x3_7*w8 let a14:=a14+x3_8*w8 let x3_9:=xg hu h 3 9 let a15:=a15+x3_9*w8 k a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 @[specialize] def u2 (af:п-> п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (o:м) (V HV Wo x0 wb nc y ob c:н): (cb wi:н)->(hu:UZ X Wz nc c cb wi HV V 3 9)->(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15:р)->(out:о п) -> (ho:obа+Woа+wbа<= outг/\0 о п:=id λcb wi hu a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho=> if h:c u2 af d lo sp X Wz o V HV Wo x0 wb nc y ob (c+1) (cb+HV) (wi+9) (cT hu h) a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho else e2 af d lo sp o Wo x0 wb y ob a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 out ho termination_by ncа-cа decreasing_by have:=β.mp h;rw[Dense.ae h];omega lemma fl (af:jJ-> jJ) (d:CD) (lo sp:Д) (X g:FloatArray) (o:м) (V e Z x0 H b y ob:н) (B:о jJ) (ho:obа+Zа+Hа<= Bг/\0(cа Dа=j+cа*eа) -> (cа Gа=l+9*cа) -> u2 af d lo sp X g o V e Z x0 H b y ob c D G A I J K L M N O R U Y p q r u v x B ho=e2 af d lo sp o Z x0 H y ob (cf (UL X g j l eа Vа 0 0) bа cа I) (cf (UL X g j l eа Vа 0 1) bа cа J) (cf (UL X g j l eа Vа 0 2) bа cа K) (cf (UL X g j l eа Vа 0 3) bа cа L) (cf (UL X g j l eа Vа 0 4) bа cа M) (cf (UL X g j l eа Vа 0 5) bа cа N) (cf (UL X g j l eа Vа 0 6) bа cа O) (cf (UL X g j l eа Vа 0 7) bа cа R) (cf (UL X g j l eа Vа 1 0) bа cа U) (cf (UL X g j l eа Vа 1 1) bа cа Y) (cf (UL X g j l eа Vа 1 2) bа cа p) (cf (UL X g j l eа Vа 1 3) bа cа q) (cf (UL X g j l eа Vа 1 4) bа cа r) (cf (UL X g j l eа Vа 1 5) bа cа u) (cf (UL X g j l eа Vа 1 6) bа cа v) (cf (UL X g j l eа Vа 1 7) bа cа x) B ho:=by intro m;induction m with | zero=> intro c D G A I J K L M N O R U Y p q r u v x h1 _ _;rw[u2];dsimp only[id];rw[AI (by rw[β];omega)] simp only[eM _ _ _ _ (by omega:¬c.toNat intro c D G A I J K L M N O R U Y p q r u v x h1 h2 h3;have F:cаby rw[Dense.ae h] at h4;rw[uC A h4,Dense.ae h,h2 F,Θ];omega) (λ_=>by rw[Dense.ac (by have:=A.2.1;have:=A.2.2.2.1;have:=ε;simp only[jH];omega),Dense.ae h,h3 F];simp only[jH];omega)] simp (disch:=simp) only[Dense.ae h,eP _ _ _ _ F,gR A h,gQ A h,h2 F,h3 F,UL, jH,jY,kB,jO] @[inline] def dC (af:п-> п) (d:@& CD) (lo sp:Д) (o:м) (x0 wb y ob:н) (a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11:р) (out:о п) (ho:obа+wbа<= outг/\0fz af d lo sp o (y+0) (x0+0) a0) true (λ_=>aj ho 0 ho.2.1)) (ob+1) (λ_=>fz af d lo sp o (y+0) (x0+1) a1) (1aj ho 1 (eD hc))) (ob+2) (λ_=>fz af d lo sp o (y+0) (x0+2) a2) (2aj ho 2 (eD hc))) (ob+3) (λ_=>fz af d lo sp o (y+0) (x0+3) a3) (3aj ho 3 (eD hc))) (ob+4) (λ_=>fz af d lo sp o (y+0) (x0+4) a4) (4aj ho 4 (eD hc))) (ob+5) (λ_=>fz af d lo sp o (y+0) (x0+5) a5) (5aj ho 5 (eD hc))) (ob+6) (λ_=>fz af d lo sp o (y+0) (x0+6) a6) (6aj ho 6 (eD hc))) (ob+7) (λ_=>fz af d lo sp o (y+0) (x0+7) a7) (7aj ho 7 (eD hc))) (ob+8) (λ_=>fz af d lo sp o (y+0) (x0+8) a8) (8aj ho 8 (eD hc))) (ob+9) (λ_=>fz af d lo sp o (y+0) (x0+9) a9) (9aj ho 9 (eD hc))) (ob+10) (λ_=>fz af d lo sp o (y+0) (x0+10) a10) (10aj ho 10 (eD hc))) (ob+11) (λ_=>fz af d lo sp o (y+0) (x0+11) a11) (11aj ho 11 (eD hc))).1 lemma gl (p:jJ-> jJ) (d:CD) (r u:Д) (o:м) (v g y l:н) (A:м-> р) (m:о jJ) (q:lа+gа<= mг/\0 jJ) (b:∀k:м,k fz p d r u o (y+0) (v+kд) (A k)=G (lа+k)): RW G (λj=>lа<= j/\jeo l 11 А) (λe=>b 11 e) (ai (ec g 10 Б) (λ_=>eo l 10 А) (λe=>b 10 e) (ai (ec g 9 Б) (λ_=>eo l 9 А) (λe=>b 9 e) (ai (ec g 8 Б) (λ_=>eo l 8 А) (λe=>b 8 e) (ai (ec g 7 Б) (λ_=>eo l 7 А) (λe=>b 7 e) (ai (ec g 6 Б) (λ_=>eo l 6 А) (λe=>b 6 e) (ai (ec g 5 Б) (λ_=>eo l 5 А) (λe=>b 5 e) (ai (ec g 4 Б) (λ_=>eo l 4 А) (λe=>b 4 e) (ai (ec g 3 Б) (λ_=>eo l 3 А) (λe=>b 3 e) (ai (ec g 2 Б) (λ_=>eo l 2 А) (λe=>b 2 e) (ai (ec g 1 Б) (λ_=>eo l 1 А) (λe=>b 1 e) (ai (AX q.2.1).symm (λ_=>eo l 0 А) (λe=>b 0 e) (RW.fc G _ _ m))))))))))))) λj=>А @[inline] def iR (X Wz:@& FloatArray) (V HV nc c cb wi:н) (hu:UZ X Wz nc c cb wi HV V 2 17) (h:c р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> р-> о п):о п:= let w0:=wg hu h 0 let w1:=wg hu h 1 let w2:=wg hu h 2 let w3:=wg hu h 3 let w4:=wg hu h 4 let w5:=wg hu h 5 let w6:=wg hu h 6 let w7:=wg hu h 7 let w8:=wg hu h 8 let x0_0:=xg hu h 0 0 let a0:=a0+x0_0*w0 let x0_1:=xg hu h 0 1 let a1:=a1+x0_1*w0 let x0_2:=xg hu h 0 2 let a2:=a2+x0_2*w0 let x0_3:=xg hu h 0 3 let a3:=a3+x0_3*w0 let x0_4:=xg hu h 0 4 let a4:=a4+x0_4*w0 let x0_5:=xg hu h 0 5 let a5:=a5+x0_5*w0 let x0_6:=xg hu h 0 6 let a6:=a6+x0_6*w0 let x0_7:=xg hu h 0 7 let a7:=a7+x0_7*w0 let x0_8:=xg hu h 0 8 let a8:=a8+x0_8*w0 let x0_9:=xg hu h 0 9 let a9:=a9+x0_9*w0 let x0_10:=xg hu h 0 10 let a10:=a10+x0_10*w0 let x0_11:=xg hu h 0 11 let a11:=a11+x0_11*w0 let a0:=a0+x0_1*w1 let a1:=a1+x0_2*w1 let a2:=a2+x0_3*w1 let a3:=a3+x0_4*w1 let a4:=a4+x0_5*w1 let a5:=a5+x0_6*w1 let a6:=a6+x0_7*w1 let a7:=a7+x0_8*w1 let a8:=a8+x0_9*w1 let a9:=a9+x0_10*w1 let a10:=a10+x0_11*w1 let x0_12:=xg hu h 0 12 let a11:=a11+x0_12*w1 let a0:=a0+x0_2*w2 let a1:=a1+x0_3*w2 let a2:=a2+x0_4*w2 let a3:=a3+x0_5*w2 let a4:=a4+x0_6*w2 let a5:=a5+x0_7*w2 let a6:=a6+x0_8*w2 let a7:=a7+x0_9*w2 let a8:=a8+x0_10*w2 let a9:=a9+x0_11*w2 let a10:=a10+x0_12*w2 let x0_13:=xg hu h 0 13 let a11:=a11+x0_13*w2 let x1_0:=xg hu h 1 0 let a0:=a0+x1_0*w3 let x1_1:=xg hu h 1 1 let a1:=a1+x1_1*w3 let x1_2:=xg hu h 1 2 let a2:=a2+x1_2*w3 let x1_3:=xg hu h 1 3 let a3:=a3+x1_3*w3 let x1_4:=xg hu h 1 4 let a4:=a4+x1_4*w3 let x1_5:=xg hu h 1 5 let a5:=a5+x1_5*w3 let x1_6:=xg hu h 1 6 let a6:=a6+x1_6*w3 let x1_7:=xg hu h 1 7 let a7:=a7+x1_7*w3 let x1_8:=xg hu h 1 8 let a8:=a8+x1_8*w3 let x1_9:=xg hu h 1 9 let a9:=a9+x1_9*w3 let x1_10:=xg hu h 1 10 let a10:=a10+x1_10*w3 let x1_11:=xg hu h 1 11 let a11:=a11+x1_11*w3 let a0:=a0+x1_1*w4 let a1:=a1+x1_2*w4 let a2:=a2+x1_3*w4 let a3:=a3+x1_4*w4 let a4:=a4+x1_5*w4 let a5:=a5+x1_6*w4 let a6:=a6+x1_7*w4 let a7:=a7+x1_8*w4 let a8:=a8+x1_9*w4 let a9:=a9+x1_10*w4 let a10:=a10+x1_11*w4 let x1_12:=xg hu h 1 12 let a11:=a11+x1_12*w4 let a0:=a0+x1_2*w5 let a1:=a1+x1_3*w5 let a2:=a2+x1_4*w5 let a3:=a3+x1_5*w5 let a4:=a4+x1_6*w5 let a5:=a5+x1_7*w5 let a6:=a6+x1_8*w5 let a7:=a7+x1_9*w5 let a8:=a8+x1_10*w5 let a9:=a9+x1_11*w5 let a10:=a10+x1_12*w5 let x1_13:=xg hu h 1 13 let a11:=a11+x1_13*w5 let x2_0:=xg hu h 2 0 let a0:=a0+x2_0*w6 let x2_1:=xg hu h 2 1 let a1:=a1+x2_1*w6 let x2_2:=xg hu h 2 2 let a2:=a2+x2_2*w6 let x2_3:=xg hu h 2 3 let a3:=a3+x2_3*w6 let x2_4:=xg hu h 2 4 let a4:=a4+x2_4*w6 let x2_5:=xg hu h 2 5 let a5:=a5+x2_5*w6 let x2_6:=xg hu h 2 6 let a6:=a6+x2_6*w6 let x2_7:=xg hu h 2 7 let a7:=a7+x2_7*w6 let x2_8:=xg hu h 2 8 let a8:=a8+x2_8*w6 let x2_9:=xg hu h 2 9 let a9:=a9+x2_9*w6 let x2_10:=xg hu h 2 10 let a10:=a10+x2_10*w6 let x2_11:=xg hu h 2 11 let a11:=a11+x2_11*w6 let a0:=a0+x2_1*w7 let a1:=a1+x2_2*w7 let a2:=a2+x2_3*w7 let a3:=a3+x2_4*w7 let a4:=a4+x2_5*w7 let a5:=a5+x2_6*w7 let a6:=a6+x2_7*w7 let a7:=a7+x2_8*w7 let a8:=a8+x2_9*w7 let a9:=a9+x2_10*w7 let a10:=a10+x2_11*w7 let x2_12:=xg hu h 2 12 let a11:=a11+x2_12*w7 let a0:=a0+x2_2*w8 let a1:=a1+x2_3*w8 let a2:=a2+x2_4*w8 let a3:=a3+x2_5*w8 let a4:=a4+x2_6*w8 let a5:=a5+x2_7*w8 let a6:=a6+x2_8*w8 let a7:=a7+x2_9*w8 let a8:=a8+x2_10*w8 let a9:=a9+x2_11*w8 let a10:=a10+x2_12*w8 let x2_13:=xg hu h 2 13 let a11:=a11+x2_13*w8 k a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 @[specialize] def dY (af:п-> п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (o:м) (V HV x0 wb nc y ob c:н): (cb wi:н)->(hu:UZ X Wz nc c cb wi HV V 2 17)->(a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11:р)->(out:о п) -> (ho:obа+wbа<= outг/\0 о п:=id λcb wi hu a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 out ho=> if h:c dY af d lo sp X Wz o V HV x0 wb nc y ob (c+1) (cb+HV) (wi+9) (cT hu h) a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 out ho else dC af d lo sp o x0 wb y ob a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 out ho termination_by ncа-cа decreasing_by have:=β.mp h;rw[Dense.ae h];omega lemma dZ (R:jJ-> jJ) (d:CD) (lo sp:Д) (X g:FloatArray) (o:м) (V e x0 B b y O:н) (u:о jJ) (ho:Oа+Bа<= uг/\0(cа vа=j+cа*eа) -> (cа Aа=l+9*cа) -> dY R d lo sp X g o V e x0 B b y O c v A r D F G H I J K L M N p q u ho=dC R d lo sp o x0 B y O (cf (UL X g j l eа Vа 0 0) bа cа D) (cf (UL X g j l eа Vа 0 1) bа cа F) (cf (UL X g j l eа Vа 0 2) bа cа G) (cf (UL X g j l eа Vа 0 3) bа cа H) (cf (UL X g j l eа Vа 0 4) bа cа I) (cf (UL X g j l eа Vа 0 5) bа cа J) (cf (UL X g j l eа Vа 0 6) bа cа K) (cf (UL X g j l eа Vа 0 7) bа cа L) (cf (UL X g j l eа Vа 0 8) bа cа M) (cf (UL X g j l eа Vа 0 9) bа cа N) (cf (UL X g j l eа Vа 0 10) bа cа p) (cf (UL X g j l eа Vа 0 11) bа cа q) u ho:=by intro m;induction m with | zero=> intro c v A r D F G H I J K L M N p q h1 _ _;rw[dY];dsimp only[id];rw[AI (by rw[β];omega)] simp only[eM _ _ _ _ (by omega:¬c.toNat intro c v A r D F G H I J K L M N p q h1 U Y;have x:cаby rw[Dense.ae h] at Z;rw[uC r Z,Dense.ae h,U x,Θ];omega) (λ_=>by rw[Dense.ac (by have:=r.2.1;have:=r.2.2.2.1;have:=ε;simp only[jH];omega),Dense.ae h,Y x];simp only[jH];omega)] simp (disch:=simp) only[Dense.ae h,eP _ _ _ _ x,gR r h,gQ r h,U x,Y x,UL, jH,jY,kB,jO] lemma g9 (p:м-> м-> р) (q:м-> р) (b:м) (g:∀c cf p b c a=Dense.F.ab q (9*b) (9*c) a:=by intro m;induction m with | zero=>intro c a h;rw[eM _ _ _ _ А,b8 _ _ _ _ А] | succ m j=> intro c a h;have e:cby unfold UL CP;rw[q.2 c v t x,u];have:=ϗ r (t/3) V;congr 2<;>omega) _ 0 a rfl rw[this,q.1,Aq] def FU (Tz:о м) (fu:т) (n nc HV V:н):у:= fu=true-> nа=9*ncа /\ ∀c п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V HV Wo n nc wo:н) (bp:р) (x0 wb y ib ob:н) (out:о п) (hz:ZB X Wz Tz n wo ib 16) (hu:fu=true-> UZ X Wz nc 0 ib wo HV V 2 17) (ho:obа+wbа<= outг/\0 п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V HV Wo n nc wo:н) (bp:р) (x0 wb y ib ob:н) (out:о п) (hz:ZB X Wz Tz n wo ib (Vа+8)) (hu:fu=true-> UZ X Wz nc 0 ib wo HV V 3 9) (ho:obа+Woа+wbа<= outг/\0 jJ) (d:CD) (p r:Д) (X l:FloatArray) (A:о м) (o:м) (V x F n D j:н) (b:р) (v u y g q:н) (e:о jJ) (hz) (hu) (ho): (k1 B G m d p r X l A o V x F n D j b v u y g q e hz hu ho)г=eг:=by unfold k1;split .split .rw[dZ m d p r X l o V x v u D y q e ho gа jа _ 0 g j _ b b b b b b b b b b b b rfl (λ_=>by simp) (λ_=>by simp)] unfold dC;exact (wz _ _ _ _ _).2 .rw[fk m d p r X l o V x v u D y q e ho gа jа _ 0 g j _ b b b b b b b b b b b b b b b b rfl (λ_=>by simp) (λ_=>by simp)] unfold e1;exact (wz _ _ _ _ _).2 .split .rw[dW m d p r X l A o v u n j y g q hz e ho _ 0 b b b b b b b b b b b b b b b b AJ];unfold e1;exact (wz _ _ _ _ _).2 .rw[fg m d p r X l A o v u n j y g q hz e ho _ 0 b b b b b b b b b b b b b b b b rfl];unfold e1;exact (wz _ _ _ _ _).2 lemma cN (B G:т) (p:jJ-> jJ) (d:CD) (q u:Д) (X m:FloatArray) (A:о м) (o:м) (V D l n F j:н) (b:р) (x v y g r:н) (e:о jJ) (hz) (hu) (ho): (k2 B G p d q u X m A o V D l n F j b x v y g r e hz hu ho)г=eг:=by unfold k2;split .rw[fl p d q u X m o V D l x v F y r e ho gа jа _ 0 g j _ b b b b b b b b b b b b b b b b rfl (λ_=>by simp) (λ_=>by simp)] unfold e2;exact (wz _ _ _ _ _).2 .split .rw[dX p d q u X m A o V l x v n j y g r hz e ho _ 0 b b b b b b b b b b b b b b b b AJ];unfold e2;exact (wz _ _ _ _ _).2 .rw[fh p d q u X m A o V l x v n j y g r hz e ho _ 0 b b b b b b b b b b b b b b b b rfl];unfold e2;exact (wz _ _ _ _ _).2 lemma db (J L:т) (r:jJ-> jJ) (d:CD) (u v:Д) (X p:FloatArray) (B:о м) (o:м) (V A M n D l:н) (b:р) (x q y g m:н) (e:о jJ) (hz) (hu) (ho) (G:м-> jJ) (N:FU B L n D A V) (K:∀kmа<= j/\j< mа+qа) e (k1 J L r d u v X p B o V A M n D l b x q y g m e hz hu ho):=by unfold k1;split .rename_i h have H:∀kby have O:=N h;simp only[ρ];rw[ga X p B l nа Dа Aа Vа gа 0 k (gа+k) b O А];exact K k I split .rename_i R rw[dZ r d u v X p o V A x q D y m e ho gа lа _ 0 g l _ b b b b b b b b b b b b rfl (λ_=>by simp) (λ_=>by simp)] exact gl r d u v o x q y m (λk=>cf (UL X p gа lа Aа Vа 0 k) Dа (0:н)а b) e ho (by simpa only[jH] using Α.mp R) G H .rw[fk r d u v X p o V A x q D y m e ho gа lа _ 0 g l _ b b b b b b b b b b b b b b b b rfl (λ_=>by simp) (λ_=>by simp)] exact c8 r d u v o x q y m (λk=>cf (UL X p gа lа Aа Vа 0 k) Dа (0:н)а b) e ho G H .split .rw[dW r d u v X p B o x q n l y g m hz e ho _ 0 b b b b b b b b b b b b b b b b AJ] exact c8 r d u v o x q y m (λk=>Dense.F.ab (CP X p B l (gа+k)) nа (0:н)а b) e ho G (λk I=>by simp only[ρ];exact K k I) .rw[fg r d u v X p B o x q n l y g m hz e ho _ 0 b b b b b b b b b b b b b b b b rfl] exact c8 r d u v o x q y m (λk=>Dense.F.ab (CP X p B l (gа+k)) nа (0:н)а b) e ho G (λk I=>by simp only[ρ];exact K k I) lemma ij (L N:т) (x:jJ-> jJ) (d:CD) (A B:Д) (X m:FloatArray) (q:о м) (o:м) (V H v n K l:н) (b:р) (D u y e p:н) (g:о jJ) (hz) (hu) (ho) (G:м-> jJ) (O:FU q N n K H V) (I:∀k(pа<= j/\jby simp) (λ_=>by simp)] exact bv x d A B o v D u y p (λk=>cf (UL X m eа lа Hа Vа 0 k) Kа (0:н)а b) (λk=>cf (UL X m eа lа Hа Vа 1 k) Kа (0:н)а b) g ho G (λk r=>by have M:=O h;simp only[ρ];rw[ga X m q l nа Kа Hа Vа eа 0 k (eа+k) b M А];exact I k r) (λk r=>by have M:=O h;simp only[ρ];rw[ga X m q l nа Kа Hа Vа eа 1 k (eа+(Vа+k)) b M А];exact J k r) .split .rw[dX x d A B X m q o V v D u n l y e p hz g ho _ 0 b b b b b b b b b b b b b b b b AJ] exact bv x d A B o v D u y p (λk=>Dense.F.ab (CP X m q l (eа+k)) nа (0:н)а b) (λk=>Dense.F.ab (CP X m q l (eа+(Vа+k))) nа (0:н)а b) g ho G (λk r=>by simp only[ρ];exact I k r) (λk r=>by simp only[ρ];exact J k r) .rw[fh x d A B X m q o V v D u n l y e p hz g ho _ 0 b b b b b b b b b b b b b b b b rfl] exact bv x d A B o v D u y p (λk=>Dense.F.ab (CP X m q l (eа+k)) nа (0:н)а b) (λk=>Dense.F.ab (CP X m q l (eа+(Vа+k))) nа (0:н)а b) g ho G (λk r=>by simp only[ρ];exact I k r) (λk r=>by simp only[ρ];exact J k r) lemma bk {j g:н} (l:j woа+9*ncа<= Wzе /\ ∀cby have:=D t I;omega,А,F, λh=>⟨(o h).1,λc G=>by have:=(o h).2 c G;omega⟩⟩ lemma fK {X j:FloatArray} {e:о м} {x:т} {n G l o V g b m:н} {B O N:м} (A:R1 X j e x n G l o V g B O N) (I:bа=B) (F:mby have:=v t D;rw[Dense.ac А];omega⟩ lemma jg {X j:FloatArray} {e:о м} {x:т} {n G l o V g b m:н} {B O N:м} (A:R1 X j e x n G l o V g B O N) (I:bа+Vа=B) (F:mby have:=v t D;rw[Dense.ac А];omega⟩ lemma fJ {X j:FloatArray} {r:о м} {l:т} {n o p e V g b q:н} {B O N:м} (D:R1 X j r l n o p e V g B O N) (J:bа=B) (F:q UZ X j o 0 (b+q) p e V 2 17:=by intro A;obtain ⟨-,-,u,v,I,-,-,-,x⟩:=D;obtain ⟨G,H⟩:=x A;have:=β.mp F;have:=ε;refine ⟨v,u,by simp,by simpa using G,λc m=>?_⟩ simp only[ρ,lw] at m;have:=H c m;rw[Dense.ac А];omega lemma jf {X j:FloatArray} {r:о м} {l:т} {n o p e V g b q:н} {B O N:м} (D:R1 X j r l n o p e V g B O N) (J:bа+Vа=B) (F:q UZ X j o 0 (b+q) p e V 3 9:=by intro A;obtain ⟨-,-,u,v,I,-,-,-,x⟩:=D;obtain ⟨G,H⟩:=x A;have:=β.mp F;have:=ε;refine ⟨v,u,by simp,by simpa using G,λc m=>?_⟩ simp only[ρ,lw] at m;have:=H c m;rw[Dense.ac А];omega lemma fI {X p:FloatArray} {o:о м} {q:т} {n v x m V g j l e:н} {B O N:м} {b:о jJ} (u:R1 X p o q n v x m V g B O N) (r:jа=O) (G:0 п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V HV Wo n nc wo:н) (bp:р) (y ib ob:н) (x0:н) (out:о п) (hr:R1 X Wz Tz fu n nc wo HV V Wo (ibа+Vа) (obа+Woа) outг):о п:= if hx:x0 п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V HV Wo n nc wo:н) (bp:р) (y ib ob:н) (x0:н) (out:о п) (hr:R1 X Wz Tz fu n nc wo HV V Wo ibа obа outг):о п:= if hx:x0 jJ) (d:CD) (G J:Д) (X v:FloatArray) (u:о м) (o:м) (V r j n H K:н) (A:р) (y F I:н):∀m (g:н) (b:о jJ) (hr), jа-gа<= m->(cp l B x d G J X v u o V r j n H K A y F I g b hr)г=bг:=by intro m;induction m with | zero=> intro g b hr D;rw[cp,AI (by rw[β];have:=j.toNat_lt_size;omega)] | succ m q=> intro g b hr D;rw[cp];split .rename_i e;dsimp only;split .rw[q,aG,aG];have:=xs _ (bk e).1 (bk e).2.2;omega .rename_i p;rw[q,cN];have:=xs _ (bM e p).1 (bM e p).2.2;omega .rfl lemma iN {o W x w A B C:м} (b:A=o+x) (e:B=o+W+x) (g:C=x+w) (l:C<= W) (j:м): (((A<= j/\j jJ) (d:CD) (U Y:Д) (X B:FloatArray) (u:о м) (o:м) (V A g n J K:н) (N:р) (y r l:н) (G:м-> jJ) (hF:FU u H n J A V) (hG:∀L:н,Lа fz M d U Y o (y+0) L (Dense.F.ab (CP X B u K (rа+Lа)) nа 0 N)=G (lа+Lа)): ∀m (b:н) (e:о jJ) (q:R1 X B u H n J K A V g rа lа eг), gа-bа<= m-> bа<= gа -> RW G (λj=>lа+bа<= j/\j intro b e q h1 h2;rw[cs,AI (by rw[β];omega)] exact ⟨rfl,λj _=>by rw[AB А]⟩ | succ m ih=> intro b e q h1 h2;have:=ε;have Z:=q.2.2.2.2.1;have a7:=q.2.2.2.2.2.2.1;have a8:=q.2.2.2.2.2.2.2.1;rw[cs];split .rename_i I;dsimp only have as:=β.mp I;have p:=bk I have D:(b+(if 16?_)) (ih _ _ _ (by rw[D];exact qA h1 p.1 p.2.2) (by rw[D];exact p.2.2))) (λj=>jw x D (by rw[D];exact p.2.2) j) have R:(b+kд)а=bа+k:=eo b k (qC hk p.2.2 Z);rw[O,x,qE R,qE R];exact hG _ (by rw[R];exact qD hk p.2.2) .rename_i I;exact ⟨rfl,λj _=>by rw[AB (by rw[β] at I;omega)]⟩ lemma hQ (x R:т) (N:jJ-> jJ) (d:CD) (Y sp:Д) (X I:FloatArray) (D:о м) (o:м) (V L e n Z K:н) (O:р) (y u l:н) (G:м-> jJ) (hF:FU D R n Z L V) (a0:∀B:н,Bа fz N d Y sp o (y+0) B (Dense.F.ab (CP X I D K (uа+Bа)) nа 0 O)=G (lа+Bа)) (a1:∀B:н,Bа fz N d Y sp o (y+1) B (Dense.F.ab (CP X I D K (uа+Vа+Bа)) nа 0 O)=G (lа+eа+Bа)): ∀m (b:н) (q:о jJ) (U:R1 X I D R n Z K L V e (uа+Vа) (lа+eа) qг), eа-bа<= m-> bа<= eа -> RW G (λj=>(lа+bа<= j/\j intro b q U h1 h2;rw[cp,AI (by rw[β];omega)] exact ⟨rfl,λj _=>by rw[AB А]⟩ | succ m ih=> intro b q U h1 h2;have:=ε;have M:=U.2.2.2.2.1;have a7:=U.2.2.2.2.2.2.1;have a8:=U.2.2.2.2.2.2.2.1;rw[cp];split .rename_i hx;dsimp only have a2:=β.mp hx;have J:(u+b)а=uа+bа:=Dense.ac А;have r:(l+b)а=lа+bа:=Dense.ac А;have eV:(u+V)а=uа+Vа:=Dense.ac А;have eW:(l+e)а=lа+eа:=Dense.ac А;have as:(u+V+b)а=uа+Vа+bа:=by rw[Dense.ac А,eV] have H:(l+e+b)а=lа+eа+bа:=by rw[Dense.ac А,eW] split .have g:=bk hx have A:(b+(if 16?_)) (db x R N d Y sp X I D o V L e n Z K O b _ (y+1) (u+V+b) (l+e+b) _ _ _ _ G hF (λk v=>?_))) (ih _ _ _ (by rw[A];exact qA h1 g.1 g.2.2) (by rw[A];exact g.2.2))) (λj=>iN r H A (by rw[A];exact g.2.2) j) .have p:(b+kд)а=bа+k:=eo b k (qC v g.2.2 M) rw[J,r,qE p,qE p];exact a0 _ (by rw[p];exact qD v g.2.2) .have p:(b+kд)а=bа+k:=eo b k (qC v g.2.2 M) rw[lM,as,H,qE p,qE p];exact a1 _ (by rw[p];exact qD v g.2.2) .rename_i h8 have g:=bM hx h8;have A:(b+(e-b))а=bа+(e-b)а:=Dense.ac (qH g.2.2 M this) refine RW.cg (RW.tr (ij x R N d Y sp X I D o V L e n Z K O b _ y (u+b) (l+b) q _ _ _ G hF (λk v=>?_) (λk v=>?_)) (ih _ _ _ (by rw[A];exact qA h1 g.1 g.2.2) (by rw[A];exact g.2.2))) (λj=>iN r (by rw[r,Nat.add_right_comm]) A (by rw[A];exact g.2.2) j) .have p:(b+kд)а=bа+k:=eo b k (qC v g.2.2 M) rw[J,r,qE p,qE p];exact a0 _ (by rw[p];exact qD v g.2.2) .have p:(b+kд)а=bа+k:=eo b k (qC v g.2.2 M) rw[J,r,qF p,qG p];exact a1 _ (by rw[p];exact qD v g.2.2) .rename_i hx;exact ⟨rfl,λj _=>by rw[AB (by rw[β] at hx;omega)]⟩ def RR (X Wz:FloatArray) (Tz:о м) (fu:т) (n nc wo HV V Wo HU y:н) (ib ob N:м):у:= yа<= HUа/\HUа+2<2^32 /\ ∀k,yа+k R1 X Wz Tz fu n nc wo HV V Wo (ib+k*Vа) (ob+k*Woа) N lemma dm {y b:н} (e:yа<= bа) (g:bа+2<2^32):(y+2)а=yа+2:=by have:=ε;rw[Dense.ac (by simp only[jH];omega)];simp only[jH] lemma iB {X o:FloatArray} {m:о м} {p:т} {n q r l V b j y:н} {B O N:м} (g:RR X o m p n q r l V b j y B O N) (u:y+2<= j):R1 X o m p n q r l V b (B+Vа) (O+bа) N:=by have e:=dm g.1 g.2.1;rw[Α,e] at u;have:=g.2.2 1 А;rw[k9,k9] at this;exact this lemma ji {X l:FloatArray} {g:о м} {m:т} {n o p e V j b y:н} {B O N:м} (r:RR X l g m n o p e V j b y B O N) (q:y?_⟩ rw[l] at H;have r:=D (k+2) А;have J:eа+(k+2)*Vа=eа+Vа+Vа+k*Vа:=by ring have K:gа+(k+2)*bа=gа+bа+bа+k*bа:=by ring rw[J,K] at r;have:=ε;have L:=r.2.2.2.2.1;have M:=r.2.2.2.2.2.2.1;have O:=r.2.2.2.2.2.2.2.1 have F:(e+V+V)а=eа+Vа+Vа:=by rw[Dense.ac (by rw[Dense.ac А];omega),Dense.ac А] have G:(g+b+b)а=gа+bа+bа:=by rw[Dense.ac (by rw[Dense.ac А];omega),Dense.ac А] rw[F,G];exact r lemma jh {X o:FloatArray} {l:о м} {p:т} {n r u j V m b y:н} {B O N:м} (g:RR X o l p n r u j V m b y B O N) (q:y+2<= b):bа-(y+2)а п) (d:@& CD) (lo sp:Д) (X Wz:@& FloatArray) (Tz:@& о м) (o:м) (V HV Wo n nc wo:н) (HU:н) (bp:р) (q4:т) (y ib ob:н) (out:о п) (hr:RR X Wz Tz fu n nc wo HV V Wo HU y ibа obа outг):о п:= if h2:y+2<= HU then ba arm fu af d lo sp X Wz Tz o V HV Wo n nc wo HU bp q4 (y+2) (ib+V+V) (ob+Wo+Wo) (cp arm fu af d lo sp X Wz Tz o V HV Wo n nc wo bp y ib ob 0 out (iB hr h2)) (by rw[ia arm fu af d lo sp X Wz Tz o V HV Wo n nc wo bp y ib ob _ 0 out _ AJ];exact jj hr h2) else if h1:y jJ) (d:CD) (Z sp:Д) (X J:FloatArray) (H:о м) (o:м) (V I b n O R p:н) (Y:р) (q4:т) (G:м-> jJ) (hF:FU H L n O I V) (D q:м) (hI:D+pа*Vа<2^32) (hL:∀yu e:н,yuа eа fz U d Z sp o yu e (Dense.F.ab (CP X J H R (D+yuа*Vа+eа)) nа 0 Y)=G (q+yuа*bа+eа)): ∀m (y r l:н) (g:о jJ) (x:RR X J H L n O R I V b p y rа lа gг), pа-yа<= m-> rа=D+yа*Vа-> lа=q+yа*bа -> RW G (λj=>lа<= j/\j intro y r l g x h1 as a0;have:=ζ bа (А:pа<= yа) rw[ba,AI (by rw[Α,dm x.1 x.2.1];omega),AI (by rw[β];omega)] exact ⟨rfl,λj _=>by rw[AB А]⟩ | succ m ih=> intro y r l g x h1 as a0;have:=ε;have b1:=x.1;have b2:=x.2.1;have K:=dm b1 b2;rw[ba];split .rename_i M have u:=M;rw[Α,K] at u have e1:(y+1)а=yа+1:=by rw[Dense.ac (by simp only[jH];omega)];simp only[jH] have r1:=iB x M;have a7:=r1.2.2.2.2.2.2.1;have a8:=r1.2.2.2.2.2.2.2.1;have mV:=ζ Vа u;have mW:=ζ bа u;have m1:(yа+2)*Vа=yа*Vа+Vа+Vа:=by ring have m2:(yа+2)*bа=yа*bа+bа+bа:=by ring have eI:(r+V+V)а=D+(y+2)а*Vа:=by rw[K,Dense.ac (by rw[Dense.ac А];omega),Dense.ac А];omega have eO:(l+b+b)а=q+(y+2)а*bа:=by rw[K,Dense.ac (by rw[Dense.ac А];omega),Dense.ac А];omega refine RW.cg (RW.tr (hQ A L U d Z sp X J H o V I b n O R Y y r l G hF (λe N=>?_) (λe N=>?_) _ 0 g _ AJ (by simp)) (ih (y+2) (r+V+V) (l+b+b) _ _ А eI eO)) (λj=>by simp only[ρ,ό,eO,K];omega) .rw[lM] have h:=hL y e А N rw[(А:rа+eа=D+yа*Vа+eа), show lа+eа=q+yа*bа+eа by omega] exact h .have h:=hL (y+1) e А N rw[e1] at h;have:=ϗ yа 1 Vа;have:=ϗ yа 1 bа rw[(А:rа+Vа+eа=D+(yа+1)*Vа+eа), show lа+bа+eа=q+(yа+1)*bа+eа by omega] exact h .rename_i M have u:¬yа+2<= pа:=by rw[Α,K] at M;exact M split .rename_i B have v:=β.mp B have mW:pа*bа=yа*bа+bа:=by rw[(А:pа=yа+1),ϗ,k9] refine RW.cg (ic A L U d Z sp X J H o V I b n O R Y y r l G hF (λe N=>?_) _ 0 g _ AJ (by simp)) (λj=>by simp only[ρ,ό];omega) rw[lM];have h:=hL y e v N rw[(А:rа+eа=D+yа*Vа+eа), show lа+eа=q+yа*bа+eа by omega] exact h .rename_i B have v:¬yаby rw[AB А]⟩ @[noinline] def cH:м:=2^32 lemma ju (d:CD) (c:CC d.M) (o q:м) (O:т) (a:о jJ) (b:(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+15<= d.Xе /\ q+d.s.h*d.s.w<= aг/\aг?_⟩ simp only[ρ,ϩ] at U;have m1:k*(W+2)<=(H-1)*(W+2):=ζ _ А;have Z:(k+1)*W<= H*W:=ζ _ А;rw[ϗ,k9] at Z;refine ⟨u,v,A,hX,А,λt Y=>by have:=x t Y;omega,А,p,λm=>?_⟩ simp only[Μ,AO] at m;obtain ⟨-,N,f2⟩:=m;have j:(d.k/9)да=d.k/9:=Dense.aa А;rw[j];refine ⟨N,λr R=>?_⟩ have m3:r*e<=(d.k/9-1)*((H+2)*(W+2)):=Ϥ А g;have m4:(H+1)*(W+2)=(H-1)*(W+2)+2*(W+2):=by rw[<- ϗ];congr 1;omega omega @[specialize] def bD (af:п-> п) (d:@& CD) (c:@& CC d.M) (o q:м) (bp:р) (fu:т) (a:о п): о п:= if hb:(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+15<= d.Xе /\ q+d.s.h*d.s.w<= aг/\aг jJ) (d:CD) (c:CC d.M) (o q:м) (p:р) (K:т) (a:о jJ) (G:м-> jJ) (hF:K=true-> c.n=9*(d.k/9) /\ ∀m(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+(d.s.h-1)*(d.s.w+2)+d.s.w+d.M+15 <= d.Xе) (hq:q+d.s.h*d.s.w<= aг) (hN:aг<2^32) (hH:d.s.h+2<2^32) (hL:∀l g:н,lа gа ∀S,S=Dense.F.ab (λj=>d.X.data[(if d.D then o else 0)* ((d.s.h+2)*(d.s.w+2))+lа*(d.s.w+2)+gа+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 p -> fz r d (Fac.cF d.hh) (Fac.cd d.hh) o l g S=G (q+lа*d.s.w+gа)): RW G (λj=>q<= j/\j?_⟩ rw[Z m B t ht];congr 2;rcases kX m with e | e .rw[e,ϖ,ϖ] .have:(d.s.h+2)*(d.s.w+2)<=(d.k/9-1)*((d.s.h+2)*(d.s.w+2)):=ώ _ А rw[Dense.aa (n:=(d.s.h+2)*(d.s.w+2)) А] .rw[u,v] rcases kX d.s.h with e | e .have:d.s.h*(d.s.w+2)=0:=by rw[e,ϖ] omega .have:d.s.h*(d.s.w+2)=(d.s.h-1)*(d.s.w+2)+(d.s.w+2):=by rw[<- Θ];congr 1;omega omega .intro l g O N rw[u] at O;rw[x] at N;rw[v,I,x];exact hL l g O N _ (congrArg (λf=>Dense.F.ab f c.n 0 p) (funext λt=>by simp only[CP,U])) .rw[R];simp .rw[J];simp .intro j;rw[J,u,x] .rw[AI b] have e:d.s.h=0:=by by_contra h;exact b ⟨hb (Ay h),hq,hN,hH⟩ exact ⟨rfl,λj _=>by rw[e,ϖ,ό,AB А]⟩ @[specialize] def bo (K:@& о п) (i n:н) (A:FloatArray) (h:nа<= Kг/\nа<= Aе): FloatArray:= if hi:i (bo K i n A h)е=Aе /\ ∀q intro i A h p;rw[bo,AI (by rw[β];omega)] exact ⟨rfl,λq _=>by rw[AB А]⟩ | succ m r=> intro i A h p;have b:i?_⟩ rw[o q (by rw[aD];exact j),da _ _ _ _ q j,Dense.ae b,cU] by_cases e:iа=q .subst e;rw[AB А,AD rfl,AD ⟨AJ,g⟩] .rw[AB e];split_ifs<;>first | rfl | omega end CG @[inline] def cm (d:CD) (c:CC d.M) (o q:м) (fu:т) (a:о п):о п:= if d.s.w<4 then if eX then dO gX d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else dO aV d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) a else if d.J then CG.bD (λw=>Fac.aA true w) d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) fu a else CG.bD (λw=>w) d c o q (Dense.F.dw oneW*Dense.F.dw d.b[o]!) fu a @[inline] def du (d:CD) (c:CC d.M) (o q:м) (a:о п):о п:=cm d c o q false a def cJ (d:CD) (hT:∀t jJ) (A:∀o q=o*(d.s.h*d.s.w)-> aг=N->(du d c o q a)г=aг /\ ∀j q=o*(d.s.h*d.s.w)-> aг=N->(cJ d r b u o q e g l a)г=aг /\ ∀jintro o q e g l a D v _;rw[cJ,AI А];have:=ζ (d.s.h*d.s.w) (А:d.Y<= o);exact ⟨rfl,λj _=>by rw[AB А]⟩ | succ m E=> intro o q e g l a D v x;have p:oby rw[z j А,y j B];split_ifs<;>first | rfl | omega⟩ lemma fB (s:ke) (I:о jJ) (b:s.kh=3/\s.kw=3/\s.stride=1/\s.pad=1) (y x t:м) (e:t/9first | rfl | omega lemma fy (s:ke) (I:о jJ) (b:s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0) (y x t:м) (j:yfirst | rfl | omega lemma dP (s:ke) (I:о jJ) (e:м) (q:go s e) (y x t b:м) (u:y⟨AK (2^(kи+7)) (Dense.F.dw 0)⟩ def xT (n:м):FloatArray:= let k:=Ar n+1-7 if k<10 then XT[k]! else ⟨AK n (Dense.F.dw 0)⟩ lemma aW (n:м):n<=(xT n)е/\((xT n)е=n\/(xT n)е<=2^16) /\ ∀q<(xT n)е,(xT n).data[q]! =Dense.F.dw 0:=by have e:∀m q,q< m->(⟨AK m (Dense.F.dw 0)⟩:FloatArray).data[q]! =Dense.F.dw 0:=λm q h=>by simp[AF,h] unfold xT;dsimp only;split .rw[AF XT _ (by simp[XT];omega)] simp only[XT,Ξ,kJ,ύ] exact ⟨(Ϻ (n:=n)).le.trans (Η Б А), .inr (Η Б А),λq b=>e _ q b⟩ .refine ⟨?_,.inl ?_,λq b=>e _ q ?_⟩<;>simp_all[kJ] lemma cW (s:ke) (g:(s.cin*(s.h+2)+3)*(s.w+2)<2^32): s.wда=s.w/\(s.w+2)да=s.w+2/\RV s 0 0 0 0 (xT ((s.cin*(s.h+2)+3)*(s.w+2)))е:=by have:=ε;have e:s.w+2<=(s.cin*(s.h+2)+3)*(s.w+2):=ώ _ А;obtain ⟨b,j,-⟩:=aW ((s.cin*(s.h+2)+3)*(s.w+2));exact ⟨Dense.aa А,Dense.aa А,А,⟨0,by simp,by simp⟩,by simp,b,А⟩ def xF (s:ConvShape) (I:о п) (hs:Iг<2^32) (hI:s.cin*s.h*s.w<= Iг) (hN:(s.cin*(s.h+2)+3)*(s.w+2)<2^32):FloatArray:= cM I s hs hI s.wд (s.w+2)д (cW s hN).1 (cW s hN).2.1 (s.cin*(s.h+2)) rfl 0 0 0 0 (xT ((s.cin*(s.h+2)+3)*(s.w+2))) (cW s hN).2.2 lemma cX (s:ke) (I:о jJ) (g:Iг<2^32) (e:s.cin*s.h*s.w<= Iг) (b:(s.cin*(s.h+2)+3)*(s.w+2)<2^32): (s.cin*(s.h+2)+3)*(s.w+2)<=(xF s I g e b)е/\(xF s I g e b)е<2^32 /\ ∀q<(xF s I g e b)е,(xF s I g e b).data[q]! =Dense.F.dw (aO s I (q/((s.h+2)*(s.w+2))) (q/(s.w+2)%(s.h+2)) (q%(s.w+2))):=by obtain ⟨l,o,m⟩:=aW ((s.cin*(s.h+2)+3)*(s.w+2));have:=ef I s g e _ _ (cW s b).1 (cW s b).2.1 _ rfl _ 0 0 0 0 _ (cW s b).2.2 _ rfl rfl λq j=>by simp[m q j] rw[xF,this.1];exact ⟨l,А,this.2⟩ lemma ea (h w b j l y m e V:м) (v:V=w+2) (g:e=(h+2)*V) (p:y м) (H:LH d nc IX IW IB P) (hT:∀t ℝ,(∀s z s=0) -> ∑j∈j3 c.n,z (N j)=∑s∈j3 d.k,z s) (S:р) (hS:S=Dense.F.ab (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 (Dense.F.dw jR*Dense.F.dw d.b[o]!)): bY d o y x S=mc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x):=by obtain ⟨hs,a0,as,hc,hM,R,a3,U,hx,hw,Z,O,a2,hL,e,Q,p⟩:=H;have af:=hc o ho;have hB:=ea d.s.h d.s.w d.s.cin nc _ y x _ _ rfl rfl hy l af a0;have g:=Dense.F.bZ jR d.b[o]! Б (Z _).1;have B:=(Dense.F.cD jR d.b[o]! 126 IB Б (Z _).2).trans (AN one_le_two (by omega:_<= P)) simp only[gD,hS,ow,an,Dense.F.gg,Dense.bG];generalize (if d.D then o else 0)=G at* generalize hq:G*((d.s.h+2)*(d.s.w+2))+y*(d.s.w+2)+x=q at* have W:=ev d.s d.I IX hx y x;have E:=λu v=>(Dense.F.cD (j7 d.s d.I y x u) d.K[v]! _ _ (W _).2 (hw _).2).trans (AN one_le_two O) have V:=λu v=>Dense.F.bZ (j7 d.s d.I y x u) d.K[v]! (W _).1 (hw _).1 have hX:∀tby obtain ⟨q1,q2,q3⟩:=aB (G+pc d.kk t) (y+py d.kk t) (x+px d.kk t) (d.s.h+2) (d.s.w+2) (by have:=dh d.kk t;omega) (by have:=dg d.kk t;omega) rw[U _ (by have:=hT t m;omega),show q+d.T[t]! =((G+pc d.kk t)*(d.s.h+2)+(y+py d.kk t))*(d.s.w+2)+(x+px d.kk t) by rw[<- hq,R t m];ring,q1,q2,q3,dP d.s d.I d.kk hs y x t _ hy l (by have:=df d.kk t nc (hs.imp (·.2.2.2.2) (·.2.2.2.2)) (as ▸ m);omega)] obtain ⟨fS,eS⟩:=Dense.F.bN _ _ _ _ _ rfl ▸ Dense.F.bn (λ_=>false) (λj=>d.X.data[q+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) _ _ P d.L c.n (λj l=>by obtain ⟨i1,i2,i3⟩:=r j l;rw[i2,i3,hX _ i1];exact V _ _) (λ_ _=>nofun) (λj _=>E _ _) B А e А c.n 0 _ rfl c.n.zero_le g.1 (by simp[g.2]) refine Dense.F.gP _ _ _ _ _ _ _ _ _ _ (λt m=>?_) (by simpa using g) (λt _=>?_) (λt _=>?_) hL e Q p rfl _ fS (Eq.trans_le ?_ (eS.trans ?_)) .simp only[AD m,hX t m];exact V _ _ .split;exacts [⟨(W _).1,(hw _).1⟩,⟨Б,(Z _).1⟩] .split;exacts [E _ _,B] .rw[aw,ah];push_cast;rw[<- A] .simp only[AU,if_false];rw[add_comm];congr 3 exact ϧ rfl λj l=>by simp[(r j (mr l)).1] .exact λs a1 h0=>by simp[a1,tm,sv,<- aI,h0] calc _<=(2:ℝ)^d.L*(2^(P+d.L)*2^(-54:с)):=by gcongr;exact_mod_cast (by omega:c.n<=2^d.L) _=_:=by rw[p,<- AA,<- AA,<- AQ AH,<- AQ AH];congr 1;omega lemma g8 (h w b j l e V:м) (t:V=w+2) (g:e=(h+2)*V) (v:0 м) (H:LH d N v IW IB P) (hT:∀t ℝ,(∀s z s=0) -> ∑j∈j3 c.n,z (l j)=∑s∈j3 d.k,z s) (S:р) (hS:S=Dense.F.ab (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ Gа*(d.s.w+2)+Eа+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) c.n 0 (Dense.F.dw jR*Dense.F.dw d.b[o]!)) (O:jJ-> jJ) (Z:∀w,O w=Fac.aA d.J w): fz O d (Fac.cF d.hh) (Fac.cd d.hh) o G E S=mc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o Gа Eа):=by obtain ⟨hs,a2,a1,hc,hM,V,a9,W,hx,hw,hb,Q,a8,hL,m,R,A⟩:=H;unfold fz;rw[Fac.ie O d.J Z];generalize Gа=y at*;generalize Eа=x at* have as:=hc o ho;have hB:=ea d.s.h d.s.w d.s.cin N (if d.D then o else 0) y x ((d.s.h+2)*(d.s.w+2)) (d.s.w+2) rfl rfl hy g as a2 have p:∀t[exact Or.inl h.2.2.2.2;exact Or.inr h.2.2.2.2] have a6:(if d.D then o else 0)+pc d.kk tif tif tfalse) (λj=>d.X.data[(if d.D then o else 0)*((d.s.h+2)*(d.s.w+2))+ y*(d.s.w+2)+x+c.Tz[j]!]!*c.Wz.data[c.wo+j]!) (λj=>tm (j7 d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!) (tm jR d.b[o]!) P d.L c.n (λj g=>by obtain ⟨i1,i2,i3⟩:=e j g;(try dsimp only);rw[i2,i3];exact p _ i1) (λ_ _ h=>absurd h ϰ) (λj g=>by have:=q (l j) (e j g).1.le;simpa only[AD (e j g).1] using this) (by have:=q d.k AJ;simpa only[AU,if_false] using this) А m А c.n 0 _ rfl (ϱ _) r.1 (by simp[r.2]) have a7:((tm jR d.b[o]!:с):ℝ)+∑j∈j3 c.n, ((tm (j7 d.s d.I y x ((if d.D then o else 0)*d.kk+l j)) d.K[o*d.k+l j]!:с):ℝ)= (ah (d.k+1) (λt=>if tif t(tm (if sby simp only[AD a4,tm,bP d.K[o*d.k+s]! (by rw[<- aI,h0];rfl)];simp)] simp only[AU,if_false];rw[add_comm];congr 1;exact ϧ rfl λj g=>by simp only[AD (e j (Finset.mem_range.mp g)).1] rw[hS];unfold ow;simp only[Dense.F.gg] refine (Fac.jB d.J d.k (λt=>if tif tDense.F.dw jR*Dense.F.dw d.b[o]!) d.hh P d.L (λ_=>mc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then o else 0) o y x)) (λt u=>by simp only[AD u];exact p t u) (by simpa only[AU,if_false] using r) (λt _=>?_) q hL m R A (by unfold an;rw[Dense.bG]) _ fS ?_).trans (by unfold an;rw[Dense.bG]) .dsimp only;split .exact ⟨(ev d.s d.I v hx _ _ _).1,(hw _).1⟩ .exact ⟨Б,(hb _).1⟩ .rw[<- a7] refine eS.trans ?_ calc (c.n:ℝ)*((2:ℝ)^(P+d.L)*2^(-54:с))<=2^d.L*((2:ℝ)^(P+d.L)*2^(-54:с)):=by gcongr _=(2:ℝ)^(((P+2*d.L:м):с)-54):=by rw[Af AH,AA,div_eq_mul_inv,<- zpow_neg,<- Au,<- AM];congr 2;omega _<=(2:ℝ)^(d.hhб:с):=AG Г (by rw[A];omega) end CG def gc (d:CD) (Z:т) (Wd:FloatArray) (hT:∀tcm d (cP d Z Wd hT hk hkT hW hY o ho) o q (d.kk==9) a) 0 0 0 (by simp) (AK (d.Y*(d.s.h*d.s.w)) 0) lemma oE {A a:о jJ} {M N} {G:м-> jJ} (h:Aг=aг /\ ∀j?_;have:=h.2 i (h.1 ▸ b);simp only[ly] at e;rw[AF A i b,AD ⟨ϱ _,e⟩] at this;simp[this] lemma gd (d:CD) (Z:т) (z:FloatArray) (hW:Z=true\/d.Y*d.k<= zе/\zе<2^32) (nc IX IW IB P:м) (H:LH d nc IX IW IB P) (Q:∀t zе<2^32 /\ ∀qmc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w) else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w)):=by obtain ⟨hs,a0,as,hc,hM,a4,a6,b4,hx,hw,hb,b1,b2,hL,bp,b3,b5⟩:=id H have V:∀o(G=true-> c.n=9*(d.k/9) /\ ∀m q=o*(d.s.h*d.s.w)-> aг=d.Y*(d.s.h*d.s.w)->(cm d c o q G a)г=aг /\ ∀jmc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w) else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w))) j else a[j]!:=by rintro o l q a c G ⟨-,ix,U,X,v⟩ hF hq N;have:=ε;have:=d.hX;have:=(ώ (d.s.w+2) (Nat.succ_pos _)).trans a6;have:=ml (d.s.h*d.s.w) l;unfold cm;split .simp only[show gX=aV from rfl,ite_self] refine gE _ _ _ _ _ _ _ _ (λy hy q' i a' hI hi a8 bx=>?_) N А λW=>by have R:=ea d.s.h d.s.w _ nc _ (d.s.h-1) (d.s.w-1) _ _ rfl rfl А А (hc o l) a0;omega have:=ml d.s.w hy;have e1:=aa d.s.w А;have e2:=aa q' А;have e:(o*d.s.h+y)*d.s.w=q':=by rw[ϗ,ϐ,a8,hq] obtain ⟨s,g⟩:=ir d c o y _ rfl _ (λxb r x e h2 h3=>i7 _ _ _ _ _ _ _ _ H Q o y x l hy h3 U X v _ (by subst e;unfold dV;congr 1;funext t;congr 2;omega)) _ 0 _ q'д _ a' hI AJ (by simp[e1]) (by simp[hi]) А А refine ⟨s,λi hi=>?_⟩;rw[g i hi,e1,e2];refine ite_congr rfl (λB=>?_) λ_=>rfl;obtain ⟨q1,q2,q3⟩:=aB o y (i-q') d.s.h d.s.w hy А;rw[e,Nat.add_sub_of_le B.1] at q1 q2 q3;simp only[q1,q2,q3,ρ,ϩ] .rename_i cb have h4:=lV d.s.h (А:4<= d.s.w) have O:∀L:jJ-> jJ,(∀w,L w=Fac.aA d.J w)-> CG.RW (λq=>mc d.J (an d.s d.I d.K d.b d.kk d.k (if d.D then q/(d.s.h*d.s.w) else 0) (q/(d.s.h*d.s.w)) (q/d.s.w%d.s.h) (q%d.s.w))) (λj=>q<= j/\j?_) А А А (λyu xu a2 a1 S hS=>?_) .have R:=g8 d.s.h d.s.w d.s.cin nc (if d.D then o else 0) _ _ rfl rfl W А (hc o l) a0 rw[<- hM] at R;omega .rw[CG.iZ d c nc IX IW IB P ix H Q o yu xu l a2 a1 U X v S hS L a7] obtain ⟨q1,q2,q3⟩:=aB o yuа xuа d.s.h d.s.w a2 a1;have e:(o*d.s.h+yuа)*d.s.w+xuа=q+yuа*d.s.w+xuа:=by rw[hq];ring rw[e] at q1 q2 q3;simp only[q1,q2,q3] split .rename_i hJ;exact O _ (λw=>by rw[hJ]) .rename_i hJ;exact O _ (λw=>by simp[Fac.aA,hJ]) have hf:∀o q=o*(d.s.h*d.s.w)-> aг=d.Y*(d.s.h*d.s.w)->(du d c o q a)г=aг /\ ∀jV o l q a c false hP (λh=>absurd h ϰ) hq N unfold gc;split .exact oE (gf _ _ _ _ _ _ hf _ 0 0 _ _ _ _ rfl (by simp) (by simp)) (by simp) rfl .rename_i hZ have a3:∀o (l:o(cP d Z z Q u E hW p o l).n=9*(d.k/9) /\ ∀m?_⟩ have a9:9*m+tV o l q a _ (d.kk==9) (el _ _ _ _ _ _ _ _ a5 o l _ rfl) (a3 o l) А N) _ 0 0 0 _ _ rfl (by simp) (by simp) (by simp)) (by simp) (ϩ _) lemma gT (K:о jJ) (n:м) (e:n<2^32) (b:n<= Kг): nда<= Kг/\nда<=(xT n)е:=by have:=ε;rw[Dense.aa А];exact ⟨b,(aW n).1⟩ def wd (Z:т) (K:о п) (n:м) (hn:n<2^32) (hK:n<= Kг) (hs:Kг<2^32): {W:FloatArray // Z=true\/n<= Wе/\Wе<2^32}:= if hZ:Z=true then ⟨FloatArray.emptyWithCapacity 0,Or.inl hZ⟩ else ⟨CG.bo K 0 nд (xT n) (gT K n hn hK),Or.inr (by rw[(CG.bF K nд _ 0 (xT n) (gT K n hn hK) rfl).1];have:=aW n;omega)⟩ lemma jE (K:о jJ) (n:м) (g:n<2^32) (b:n<= Kг) (h:Kг<2^32): (wd false K n g b h).1е<2^32 /\ ∀q?_⟩ rw[l q А,AD (by rw[e];simp only[ρ];omega)] @[noinline] def bs:м:=2^32 def eR (s:ConvShape) (J:т) (I K b:о п) (D:т) (nc Y:м):о п:= let H:=s.h+2 let V:=s.w+2 let HV:=H*V let kk:=s.kh*s.kw let k:=nc*kk let ex:=Dense.F.aC I 0 0 let ew:=Dense.F.aC K 0 0 let eb:=Dense.F.aC b 0 0 let P:=max (48+(exв-1)+(ewв-1)) (174+(ebв-1)) let L:=Ar (k+1)+1 let M:=(nc-1)*HV+2*V+2 let T:=Dense.F.bB (λt=>pc kk t*HV+py kk t*V+px kk t) k (Al k) if hg:go s kk/\0h.2.2.2.2) (λh=>h.2.2.2.2)) let Z:=K.any λu=>Core.mW u==0 let W:=wd Z K (Y*k) hY32 hYK hKs gc ⟨s,I,K,b,xF s I hIs hI hX32,T,D,J,k,M,L,(P+2*L-54).toUInt64,Y,kk, (cX s I hIs hI hX32).2.1,⟨hYK,hKs⟩⟩ Z W.1 hT hk32 hkT W.2 hY32 else dS s J I K b D lemma dA (s:ke) (J:т) (I K b:о jJ) (D:т) (j Y:м) (L:D=false/\j=s.cin/\Y=s.cout\/D=true/\j=1/\Y=s.cin):eR s J I K b D j Y=dS s J I K b D:=by unfold eR bs;dsimp only;split;swap;rfl;rename_i W;obtain ⟨N,-,X,v,u,t,r,Q,G,l,m,V,e,-,g,M,O,H,p⟩:=W;dsimp only;obtain ⟨B,E⟩:s.ho=s.h/\s.wo=s.w:=by rcases N with ⟨x,y,z,A,-⟩ | ⟨x,y,z,A,-⟩<;>simp[A4,A3,x,y,z,A]<;>omega obtain ⟨R,-,S⟩:=cX s I l O e;have:=ε;rw[gd _ _ _ _ j _ _ _ _ ⟨‹_›,v,by rfl,λo ho=>by rcases L with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp<;>omega,by rfl,by exact (tV _ _ _ _).2,‹_›,‹_›,by exact Dense.F.cL I А u,by exact Dense.F.cL K А t,by exact Dense.F.cL b А r,le_max_left _ _,le_max_right _ _,by exact Ϻ,‹_›,‹_›,by dsimp only;rw[lC,Ε (by simp only[j6];omega)]⟩ (by exact tM _ _ _ _ (N.imp (·.2.2.2.2) (·.2.2.2.2))) (by exact (tV _ _ _ _).1.ge) ‹_› ‹_› (λU=>by dsimp only;rw[U];exact jE K _ g p m) ‹_› ‹_›];rcases L with ⟨rfl,rfl,rfl⟩ | ⟨rfl,rfl,rfl⟩<;>simp only[dS,fT,AY,AP,kZ,conv2dWith,depthwiseSpec,depthwiseWith,B,E]<;>refine li (by simp[B,E]) λq _ _=>?_<;>simp only[am,Ξ,an,Dense.bG,ϐ,k9,ϖ,ϩ] @[inline] def rs:ConvShape:= if s.kh=1/\s.kw=1/\s.stride=1/\s.pad=0/\0mc J (ku (s.cin+1) (λt=>if tif t?_ simp only[Ξ,m,o,e,g,ϣ];congr 2;funext t;by_cases r:tsimp only[r,AY,AP];have:=ϸ (q/s.w) p;have:=ϸ q u;simp only[j7,e,g,j,l,ϣ,Nat.div_one,Nat.mod_one,ό,lw];rw[AB А,Ϩ s.h s.w,Nat.mod_mul];congr 1;ring lemma iu:kZ (rs s) J I K b=kZ s J I K b:=by unfold rs;split .obtain ⟨h,j,l,m,g,p⟩:=‹_/\_›;have o:0[omega;exact ϡ А В] .have:=g5 e;have:2^(b/2^23+22)<= Kf b:=by unfold Kf;rw[AB А,AB А,(А:b/2^23+22=23+(b/2^23-1)),AM];exact ζ _ А have:=Η Ae (А:e/2^23+23<= b/2^23+22);omega def kv (w:п):с:=sv w*2^idxOf w lemma gq: kv u=if 2^31<= uв then-(Kf (uв%2^31):с) else (Kf (uв%2^31):с):=by unfold kv sv;rw[<- gu];simp only[<- ay];split_ifs<;>push_cast<;>ring lemma bE: (sk u)в=if uв<2^31 then uв+2^31 else if uв=2^31 then 2^31 else 2^32-1-uв:=by have:=u.toNat_lt;unfold sk;split_ifs<;>simp_all[ν,<- η,ϑ]<;>omega lemma ff (a b:Е) (h:sk a Kf m ⟨cI m n,by rintro rfl;rfl,λe=>by have:=cI 0 m;have:Kf 0=0:=rfl;omega⟩ have g:=a.toNat_lt;have j:=b.toNat_lt;have:=F (aв%2^31) (bв%2^31);have:=F (bв%2^31) (aв%2^31);split_ifs at h⊢<;>omega lemma gb:Model.cmpDyadic (lv y) (lv z)=compare (kv y) (kv z):=by have b:∀w,(lv w).toReal=(kv w:ℝ)*2^(-149:с):=λw=>by rw[<- Υ,lZ];unfold kv;push_cast;rw[Af AH,AA];ring have e:(0:ℝ)<2^(-149:с):=Ao Ae _;cases h:compare (kv y) (kv z) .rw[Model.cmpDyadic_lt_iff,b,b];exact AZ (by exact_mod_cast compare_lt_iff_lt.mp h) e .rw[Model.cmpDyadic_eq_iff,b,b,compare_eq_iff_eq.mp h] .rw[Model.cmpDyadic_gt_iff,b,b];exact AZ (by exact_mod_cast compare_gt_iff_gt.mp h) e lemma bH (e:jX u=0):u=0\/u=0x80000000:=by have h:=u.toNat_lt;unfold jX at e;split_ifs at e with g .have b:=aM u;have j:=aE u;rw[g] at b;rw[<- η,<- η];simp at b⊢;omega .omega lemma fw:k4 (mx y z)=l2 (k4 y) (k4 z):=by unfold mx;split .rename_i h;have e:=jV y h.1;have g:=jV z h.2.1 unfold l2;rw[Model.withNaNSelection_of_none _ _ ((Model.chooseNaN2_eq_none_iff (k4 y) (k4 z)).2 ⟨ϥ e,ϥ g⟩),Model.compareNonNaN_eq_of_compare_eq_some _ _ _ _ (gb y z ▸ Model.compare_eq_some_cmpDyadic_of_toDyadic? _ _ e g)];rcases h.2.2 with b | b | rfl .rw[AD b,compare_lt_iff_lt.mpr (ff y z b)] .rw[AB (lD b),compare_gt_iff_gt.mpr (ff z y b)] .rw[AB (UInt32.lt_irrefl _),compare_eq_iff_eq.mpr rfl] by_cases j:jX y=0 .rcases bH y j with rfl | rfl<;>decide .simp[show Model.isZero (k4 y)=false by unfold k4;rw[Model.isZero_eq_beq_zero_of_toDyadic?_some e,decodeD_sig_zero];simpa using j] .exact aF _ lemma gO: mn (kq u:Model lx)=u:=by show Ax (kq u:Model lx).bits=u;rw[lX] lemma aH (b:jL u≠0): lv u=⟨j5 u,2^23+(kc u)в,((jL u)в:с)-150⟩:=AB b lemma ce (f:м) (e:f<2^23): kp (2^23+f) (2^23)=0:=by have b:(2^23+f)й=23:=by rw[Nat.log2_eq_iff А];constructor<;>omega unfold kp;rw[b,Nat.log2_two_pow] simp[kQ,k3, χ]<;>omega lemma dR:kr (m*2^23) (2^23)=m:=by unfold kr;simp lemma gi (q:Е) (o:kc d=0) (p:j5 d=false) (y:(jL d)в=qв+127) (t:jL d≠255) (u:qв<(jL r)в) (g:jL r≠255): jW (AV (k4 r) (k4 d))=r-(q<<<23):=by have z:=aM r;have A:=aE r;have B:(jL r)в≠255:=λh=>g (η.mp (by simpa using h)) have x:=fracOf_toNat_lt r;rw[lj];unfold mu k4 rw[jV r g,jV d t,aH r λh=>by simp[h] at u,aH d λh=>by simp[h] at y, o,p] have j:((2:м)^23==0)=false:=Б;have l:(2^23+(kc r)в==0)=false:=by simp simp only[ϋ,ό,Bool.xor_false,j,l,fT,AP];erw[<- lk,bb] unfold l3;rw[ce _ x];simp only[j,l,fT,AP,zero_add,sub_zero];rw[AB А,AB А,AB А,show ((23:с))=Int.ofNat 23 from rfl, kE] simp only[show ∀a,Nat.shiftLeft a 23=a*2^23 from λa=>χ a 23,dR];have w:((2^23+(kc r)в:м)==mv 24)=false:=by simp[mv];omega simp only[w,fT,AP];rw[AB А];set b:=r-(q<<<23) with v;have m:(q<<<23)в=qв*2^23:=by rw[ϲ];simp[χ];omega have e:bв=rв-qв*2^23:=by rw[v,ϵ _ _ (by rw[Ζ,m];omega),m] rw[<- lO,<- gO b,ofUInt32_eq_ofFields] rw[show j5 b=j5 r by rw[ϛ,ay,ay,e];omega, show (jL b)в=(jL r)в-qв by rw[aM b,e];omega, show (kc b)в=(kc r)в by rw[aE b,e];omega,(А:Int.toNat _=(jL r)в-qв),(Б:mv 23=2^23),Nat.add_sub_cancel_left];rfl lemma il (s:jJ) (h:s&&&0x7FFFFFFF=0):s=0\/s=0x80000000:=by have e:=s.toNat_lt;have b:=congrArg kN h;rw[ξ,show (0x7FFFFFFF:Е)в=2^31-1 from rfl,γ] at b;rw[<- η,<- η];simp at b⊢;omega lemma aX (b:r=0\/r=0x80000000) (e:jL d≠0) (g:jL d≠255) (h:j5 d=false): jW (AV (k4 r) (k4 d))=r:=by have j:lv r=⟨j5 r,0,0⟩:=by rcases b with rfl | rfl<;>rfl rw[lj];unfold mu k4;rw[jV r (by rcases b with rfl | rfl<;>decide),jV d g,aH d e,h,j] simp;rcases b with rfl | rfl<;>rfl lemma bh {a b:Е} (h:aoneW)) (ofW d)) lemma bl (p:DQ d):co r d=jW (AV (k4 r) (k4 d)):=by obtain ⟨b,h,j⟩:=p;have e:jL d≠255:=bh j;unfold co;dsimp only;split .obtain ⟨o,g,l,m⟩:=‹_/\_› exact (gi r d _ o b (by rw[ϵ _ _ g];have:=Ζ.mp g;simp at this⊢;omega) e (ν.mp l) (bh m)).symm split .exact (aX r d (il r ‹_›) h e b).symm .rfl lemma fE: (decide (jX u*jX jR=0)&&Bool.xor (j5 u) (j5 jR))=(u==0x80000000):=by by_cases b:jX u=0 .rcases bH u b with rfl | rfl<;>decide .simp[(Б:jX jR=2^23),(Б:j5 jR=false),b];rintro rfl;exact b Б lemma c7 (c:м):∀i,i+c<= n -> (dallNZ (kn (n:=n) λj=>fa jи) (kn (n:=n) λ_=>jR) i c=true↔ ∀t,i<= t-> t< i+c-> fa t=0x80000000):=by induction c with | zero=>intro i _;simp[dallNZ];intros;omega | succ c l=> intro i m rw[dallNZ,ar n fa i А,ar n (λ_=>jR) i А, fE,Μ,l (i+1) А,AT] exact ⟨λ⟨b,e⟩ t g o=>g.eq_or_lt.elim (. ▸ b) λh=>e t h А,λh=>⟨h i AJ А,λt b e=>h t А А⟩⟩ lemma ep (b y x t:м): I[(b*h+y*k)*w+x*k+t/k*w+t%k]! =mm h w k I b y x t:=by congr 1;ring lemma dn (p:м-> р) (n t:м) (a:р) (h:t р) (n t:м) (a:р) (h:¬t>>63)<<<31)+((E<<<23)+xR b) @[inline] def xW (b:Д):Д:= let E:=Dense.F.eF b-1195 if E<253 then xB b E else Ж lemma jc (A:р) (G:Dense.F.fv A) (T:с) (I:Dense.F.rv A=(T:ℝ)) (m:xW A.toBits<Ж): T≠0/\(xW A.toBits)ж=kb T (-298) false:=by unfold xW at m⊢;dsimp only at m⊢;unfold xB xR split at m;swap;. simp at m rename_i x;rw[AD x];have L:=A.toBits.toNat_lt have q:(Dense.F.eF A.toBits)б<2048:=by unfold Dense.F.eF;rw[ο];exact AR Ϙ Б have e:1195<=(Dense.F.eF A.toBits)б/\(Dense.F.eF A.toBits)б<1448:=by have w:=θ.mp x;rw[Τ] at w;simp only[jI,j6] at w;have:=q;omega have v:=Dense.F.eJ A G (λD=>by rw[D] at e;simp at e) rw[Dense.F.cq] at v;generalize J:(A.toBits>>>63!=0)=j at v have M:(A.toBits&&&0xfffffffffffff)б<2^52:=by rw[ο,show (0xfffffffffffff:Д)б=2^52-1 from rfl,γ];exact ϸ _ Б generalize H:((A.toBits&&&0xfffffffffffff)+0x10000000000000)<<<(10:Д)=N have l:Nб=((A.toBits&&&0xfffffffffffff)б+2^52)*2^10:=by rw[<- H];simp only[υ,μ,jI,χ,jO];omega generalize u:(Dense.F.eF A.toBits-1085)=b have B:bб=(Dense.F.eF A.toBits)б-1085:=by rw[<- u,Κ _ _ (τ.mpr (by simp only[jI];omega))];rfl have g:T=(if j then-(Nб:с) else Nб)*2^bб:=by have y:(2:ℝ)^(((Dense.F.eF A.toBits)б:с)-1075)=2^10*2^(bб:с):=by rw[show (2:ℝ)^10=(2:ℝ)^(10:с) by norm_num,<- AQ AH];congr 1;omega have z:(T:ℝ)=(((if j then-(Nб:с) else Nб)*2^bб:с):ℝ):=by rw[<- I,v,y,l];split<;>push_cast<;>rw[AA]<;>ring exact_mod_cast z have r:Nб≠0:=by rw[l];exact Nat.ne_of_gt (lN А Б) have t:T≠0:=by rw[g];refine Aj (by split<;>omega) В refine ⟨t,?_⟩;rw[g,<- gG j N b r А];obtain ⟨K,O⟩:=bg j N b (by rw[l];omega) (by rw[l];omega) А А have o:(A.toBits>>>63)б=A.toBitsб/2^63:=by simp[δ] have E:A.toBitsб/2^63=if j=true then 1 else 0:=by rw[<- J,bL];by_cases h:2^63<= A.toBitsб<;>simp only[h,decide_true,Av,↓reduceIte,ς]<;>omega have p:(Dense.F.eF A.toBits-1195)б=(Dense.F.eF A.toBits)б-1195:=by rw[Κ _ _ (τ.mpr (by simp only[jI];omega))];rfl apply η.mp;rw[K,Ν];simp only[μ,υ,o,E,p,jI,χ,jO];split<;>omega lemma g4 (b E:Д) (l:Eб<253): 2^23<=(xR b)б/\(xR b)б<=2^24 /\ (xB b E)б=bб/2^63*2^31+(Eб*2^23+(xR b)б):=by have o:(b&&&0xfffffffffffff)б<2^52:=by rw[ο,show (0xfffffffffffff:Д)б=2^52-1 from rfl,γ];exact ϸ _ Б have m:=b.toNat_lt have h:2^23<=(xR b)б/\(xR b)б<=2^24:=by unfold xR;generalize j:((b&&&0xfffffffffffff)+0x10000000000000)<<<(10:Д)=N have g:Nб=((b&&&0xfffffffffffff)б+2^52)*2^10:=by rw[<- j];simp only[υ,μ,jI,χ,jO];omega exact (bg false N 110 (by rw[g];omega) (by rw[g];omega) Б Б).2 refine ⟨h.1,h.2,?_⟩;have e:(b>>>63)б=bб/2^63:=by simp[δ] unfold xB;simp only[μ,υ,e,jI,χ,jO];omega lemma d7 (x y:р) (r:Dense.F.fv x) (t:Dense.F.fv y) (z e:с) (h:Dense.F.rv x+Dense.F.rv y=(z:ℝ)*(2:ℝ)^e) (p:zз<2^53) (o:-1074<= e) (m: |(z:ℝ)*(2:ℝ)^e| <= (2:ℝ)^(971:с)): Dense.F.fv (x+y)/\Dense.F.rv (x+y)=(z:ℝ)*(2:ℝ)^e:=by have g:(ka z e).significand<2^53:=p;have q:(ka z e).toReal=Dense.F.rv x+Dense.F.rv y:=by rw[Dense.F.al,h] have b: |(ka z e).toReal| <= (2:ℝ)^(971:с):=by rw[Dense.F.al];exact m obtain ⟨j,l⟩:=Dense.F.gm x y r t (by rw[<- q];exact b.trans (Dense.F.pm 971 AJ)) exact ⟨j,by rw[l,h,<- Dense.F.al];exact Dense.F.rx _ g o b⟩ lemma jy (p:м-> р) (y:м-> с) (U:с) (n Y:м) (B:∀t t<= n-> Dense.F.fv a -> Dense.F.rv a=((∑s∈j3 t,y s:с):ℝ)*(2:ℝ)^U -> Dense.F.fv (Dense.F.ab p n t a) /\ Dense.F.rv (Dense.F.ab p n t a)=((∑s∈j3 n,y s:с):ℝ)*(2:ℝ)^U:=by have v:∀t,t<= n->(∑s∈j3 t,y s)з<= t*Y:=λt=>by induction t with | zero=>simp | succ t l=> intro r;rw[sum_range_succ];have o:=l А;have q:=D t А;have:=Int.natAbs_add_le (∑s∈j3 t,y s) (y t);rw[Θ];omega intro m;induction m with | zero=> intro t a A r e j;obtain rfl:t=n:=А;rw[f0 _ _ _ _ (AU _)];exact ⟨e,j⟩ | succ m l=> intro t a A r e j;have h:tpT (Dense.F.dw jR) (fa t)) n 1 (pT (Dense.F.dw jR) (fa 0))) b<Ж): (Dense.F.ak (Dense.F.ab (λt=>pT (Dense.F.dw jR) (fa t)) n 1 (pT (Dense.F.dw jR) (fa 0))) b)ж= ku n fa λ_=>jR:=by have u:jL jR≠255:=Б;have g:ao n fa λ_=>jR:=λt h=>⟨(p t h).1,u⟩ have y:∀t (Dense.F.cD (fa t) jR X 126 (p t h).2 Б).trans_eq (by congr 1;omega) have x:∀tDense.F.bZ _ _ (p t h).1 u have r:=x 0 w;have D:Finset.sum (j3 1) (λs=>((tm (fa s) jR:с):ℝ))=tm (fa 0) jR:=by simp obtain ⟨l,j⟩:=Dense.F.bn (λ_=>false) _ (λt=>tm (fa t) jR) 0 (174+X) L n x (by simp) y (by simp) E e А (n-1) 1 _ А w r.1 (by rw[r.2,D];simp) rw[<- Dense.F.bN _ n _ 1 _ rfl] at l j;generalize Dense.F.ab (λt=>pT (Dense.F.dw jR) (fa t)) n 1 (pT (Dense.F.dw jR) (fa 0))=A at l j v⊢ have q:(ah n fa λ_=>jR:ℝ)=(0:с)+∑s∈j3 n,((tm (fa s) jR:с):ℝ):=by simp[ah] have H: |Dense.F.rv A-(ah n fa λ_=>jR:ℝ)| <= (2:ℝ)^(bб:с):=by rw[q];refine j.trans ?_ calc (n:ℝ)*((2:ℝ)^(174+X+L)*2^(-54:с))<=2^L*((2:ℝ)^(174+X+L)*2^(-54:с)):=by gcongr;exact_mod_cast (by omega:n<=2^L) _=(2:ℝ)^(((174+X+2*L:м):с)-54):=by rw[Af AH,AA,div_eq_mul_inv,<- zpow_neg,<- Au,<- AM];congr 2;omega _<=(2:ℝ)^(bб:с):=AG Г (by rw[o];omega) have m: |(ah n fa λ_=>jR:ℝ)| <= (2:ℝ)^(425:с):=by rw[q,zpow_ofNat];refine (Dense.F.bm n _ _ _ y (by simp) n AJ).trans ?_ calc ((n:ℝ)+1)*2^(174+X)<=2^L*2^(174+X):=by gcongr;exact_mod_cast (by omega:n+1<=2^L) _<=2^425:=by rw[<- AM];exact AN Г А obtain ⟨z,B⟩:=Dense.F.bt A l b А _ H m v;rw[B,aq _ _ _ g z] lemma iS (b:м-> jJ) (n B Y:м) (p:0pT (Dense.F.dw jR) (b t)) n 1 (pT (Dense.F.dw jR) (b 0))).toBits<Ж): (xW (Dense.F.ab (λt=>pT (Dense.F.dw jR) (b t)) n 1 (pT (Dense.F.dw jR) (b 0))).toBits)ж= ku n b λ_=>jR:=by have o:jL jR≠255:=Б;have g:ao n b λ_=>jR:=λt e=>⟨(h t e).1,o⟩ have r:∀tby have u:sv jR=2^23:=Б;have v:jS jR=126:=Б;unfold tm bW;rw[u,v];rcases (h t e).2.1 with l | l .simp[bP _ l] .rw[show ((B:с)+149)=((B+149:м):с) by push_cast;rfl,AA];push_cast have:(2:ℝ)^(jS (b t)+126)*2^23=2^(jS (b t)-B)*2^(B+149):=by rw[<- AM,<- AM,(А:jS (b t)+126+23=jS (b t)-B+(B+149))] linear_combination (sv (b t):ℝ)*this have q:∀tby have:=Dense.F.bZ (b t) jR (h t e).1 o;exact ⟨this.1,by rw[<- r t e];exact this.2⟩ have m:=q 0 p obtain ⟨x,w⟩:=jy _ (λt=>bW B (b t)) _ n Y q (λt e=>(h t e).2.2) j А А (n-1) 1 _ А p m.1 (by rw[m.2];simp) have y:Dense.F.rv (Dense.F.ab (λt=>pT (Dense.F.dw jR) (b t)) n 1 (pT (Dense.F.dw jR) (b 0)))= ((ah n b λ_=>jR:с):ℝ):=by rw[w];unfold ah;push_cast;rw[sum_mul];exact sum_congr rfl λt e=>(r t (mr e)).symm have:=jc _ x _ y z;rw[this.2,aq n b _ g this.1] @[inline] def kY (u:п):п:=(Dense.au u-1)>>>23 lemma bK (u:jJ):(kY u)в<512/\((Dense.au u)в≠0->(kY u)в<=(jL u)в):=by have h:=Dense.aR u;have g:=(Dense.au u).toNat_lt have e:(kY u)в=(Dense.au u-1)в/2^23:=by unfold kY;rw[Ι];simp[δ] have b:(Dense.au u-1)в=(2^32-1+(Dense.au u)в)%2^32:=by rw[ϑ];simp rw[e,b];constructor<;>omega @[inline] def fd (O:п):Д:=(0:Д)-((Oл+0xFFFFFFFF)>>>32) lemma iq (O:jJ) (h:O≠0):fd O=0xFFFFFFFFFFFFFFFF:=by have b:Oв≠0:=λe=>h (η.mp e) have g:=O.toNat_lt have:(Oл+0xFFFFFFFF)>>>32=1:=by apply κ.mp;simp only[ψ,μ,Ϟ,jI,δ,jO];omega unfold fd;rw[this];rfl @[inline] def x4 (nz b:Д):Д:= let E:=(Dense.F.eF b-1197)&&&nz if E<251 then xB b E&&&nz else Ж lemma iY (x:Д):x&&&0xFFFFFFFFFFFFFFFF=x:=by apply κ.mp;rw[ο,show (0xFFFFFFFFFFFFFFFF:Д)б=2^64-1 from rfl, γ];exact ι x.toNat_lt lemma jb (b:Д) (e:x4 0xFFFFFFFFFFFFFFFF b<Ж): xW b<Ж/\2by rw[h] at g;simp at g;omega by_cases l:(Dense.au u)в=0 .have o:jL u=0:=η.mp (by rw[Dense.aR,l];rfl) have p:(kc u)в=0:=by have r:=Dense.ei u;have t:=Dense.aQ u;show (u&&&8388607)в=0;omega have m:jX u=0:=by simp[jX,o,p] exact ⟨b,.inl m,by simp[bW,bP u m]⟩ .have y:=(bK u).2 l have x:=Dense.aS u;refine ⟨b,.inr А,?_⟩;have q:=Dense.cz u;rw[abs_lt] at q;unfold bW;rw[ϙ,Int.natAbs_pow];have e:(sv u)з<=2^24:=А calc (sv u)з*(Int.natAbs 2)^(jS u-(A-1))<=2^24*2^D:= Ϥ e (Η Б А) _=2^(24+D):=(AM _ _ _).symm lemma jt (a b:jJ):(min a b)в<= aв/\(min a b)в<= bв:=by show (if a<= b then a else b)в<= _/\(if a<= b then a else b)в<= _;split<;>rename_i h<;>[have:=Ζ.mp h;have:=mt Ζ.mpr h]<;>omega lemma e7 (a b:jJ):aв<=(max a b)в/\bв<=(max a b)в:=by show _<=(if a<= b then b else a)в/\_<=(if a<= b then b else a)в;split<;>rename_i h<;>[have:=Ζ.mp h;have:=mt Ζ.mpr h]<;>omega lemma iE (b:м-> jJ) (l:0jR)=0:=by unfold ah;exact Finset.sum_eq_zero λt m=>by rw[h t (mr m)];show tm 0 jR=0;decide have e:ku n b (λ_=>jR)=0:=by rw[bU n b _ λt m=>⟨by rw[h t m];decide,Б⟩,o] have g:¬∀tby have:=(g 0 l).symm.trans (h 0 l);revert this;decide simp[kb,l.ne',c7 n b n 0 А,g] unfold av;rw[e];exact aX _ d (.inl rfl) j.2.1 (lE j.2.2) j.1 lemma bC (a b:jJ) (h:a ||| b=0):a=0/\b=0:=by have e:=congrArg kN h;rw[ϓ,ϋ,Nat.or_eq_zero_iff] at e;exact ⟨η.mp e.1,η.mp e.2⟩ lemma gw (a b:jJ) (e:aв<256) (g:bв<256):(max a b)в<256:=by show (if a<= b then b else a)в<256;split<;>assumption lemma gB (K M:jJ) (e:Kв<512) (g:Mв<256) (h:(K+26-M)>>>31=0):Mв<= Kв+26:=by have b:=congrArg kN h;rw[Ι,ϑ,Ϲ] at b;simp only[jN,ϋ,δ,jO] at b;omega @[inline] def xQ (q:р) (x0 x1 x2 x3:п):Д:= let M:=max (max (expOf x0) (expOf x1)) (max (expOf x2) (expOf x3)) if ((kY x0+26-M)>>>31 ||| (kY x1+26-M)>>>31 ||| (kY x2+26-M)>>>31 ||| (kY x3+26-M)>>>31 ||| (254-M)>>>31)=0 then x4 (fd (x0 ||| x1 ||| x2 ||| x3)) (pT q x0+pT q x1+pT q x2+pT q x3).toBits else Ж lemma iz (b:м-> jJ) (g:xQ (Dense.F.dw jR) (b 0) (b 1) (b 2) (b 3)<Ж): (xQ (Dense.F.dw jR) (b 0) (b 1) (b 2) (b 3))ж=av (2*2) b 0x40800000:=by have v:DQ 0x40800000:=Б;unfold xQ at g⊢;dsimp only at g⊢ split at g;swap;. simp at g rename_i l;rw[AD l];by_cases q:b 0 ||| b 1 ||| b 2 ||| b 3=0 .obtain ⟨p,Q⟩:=bC _ _ q;obtain ⟨h,O⟩:=bC _ _ p;obtain ⟨N,h⟩:=bC _ _ h rw[iE _ _ _ Б v λt o=>by interval_cases t<;>assumption,q,show fd 0=0 from rfl] unfold x4;simp rw[iq _ q] at g⊢;obtain ⟨w,r,u,D⟩:=jb _ g;rw[D];obtain ⟨e,A⟩:=bC _ _ l;obtain ⟨e,z⟩:=bC _ _ e;obtain ⟨e,y⟩:=bC _ _ e;obtain ⟨e,x⟩:=bC _ _ e;have E:=e7 (jL (b 0)) (jL (b 1));have G:=e7 (jL (b 2)) (jL (b 3));have H:=e7 (max (jL (b 0)) (jL (b 1))) (max (jL (b 2)) (jL (b 3))) have m:(max (max (jL (b 0)) (jL (b 1))) (max (jL (b 2)) (jL (b 3))))в<256:= gw _ _ (gw _ _ (Dense.ax _) (Dense.ax _)) (gw _ _ (Dense.ax _) (Dense.ax _)) generalize max (max (jL (b 0)) (jL (b 1))) (max (jL (b 2)) (jL (b 3)))=M at* have I:=gB _ M (bK (b 0)).1 m e;have J:=gB _ M (bK (b 1)).1 m x;have K:=gB _ M (bK (b 2)).1 m y;have L:=gB _ M (bK (b 3)).1 m z have j:Mв<=254:=by have h:=congrArg kN A;rw[Ι,ϑ] at h;simp only[jN,ϋ,δ,jO] at h;omega have W:∀t<4,Mв-26<=(kY (b t))в/\(jL (b t))в<= Mв:=λt o=>by interval_cases t<;>omega have B:pT (Dense.F.dw jR) (b 0)+pT (Dense.F.dw jR) (b 1)+pT (Dense.F.dw jR) (b 2)+pT (Dense.F.dw jR) (b 3)= Dense.F.ab (λt=>pT (Dense.F.dw jR) (b t)) 4 1 (pT (Dense.F.dw jR) (b 0)):=by rw[dn _ _ _ _ Б,dn _ _ _ _ Б,dn _ _ _ _ Б,f0 _ _ _ _ Б] rw[B] at w r u⊢ have:=iS b 4 (Mв-26-1) (2^(24+26)) Б (λt o=>gU (b t) (Mв-26) Mв 26 А j (W t o).1 (W t o).2) Г А w rw[this] at r u⊢;unfold av;rw[<- bl _ _ v];unfold co;rw[AD ⟨Б,Б,r,u⟩];rfl @[inline] def dE (sp:п) (L:м) (S:р) (O A M:п):Д:= if O=0 then 0 else if M<=254 then if M<= A+sp then xW S.toBits else if 1<= Mв/\174+(Mв-1)+L<=425 then Dense.F.ak S (120+(Mв-1)+2*L).toUInt64 else Ж else Ж def dT (I:о п) (sp:п) (L:м) (q:р) (stop:н) (hs:stopа<= Iг) (e:н) (S:р) (O A M:п):Д:= if h:e eа=U+t-> t<= N -> ∃l g j:jJ,dT I r L q b x e S O A M=dE r L (Dense.F.ab (λt=>pT q I[U+t]!) N t S) l g j /\ gв<= Aв/\Mв<= jв/\(l=0-> O=0) /\ ∀s,t<= s-> s gв<=(kY I[U+s]!)в/\(jL I[U+s]!)в<= jв/\(l=0-> I[U+s]! =0):=by intro m;induction m with | zero=> intro t e S O A M w p B;refine ⟨O,A,M,?_,AJ,AJ,id,λs _ _=>А⟩ rw[dT,AI (by rw[β];omega),f0 _ _ _ _ А] | succ m D=> intro t e S O A M w p B;have h:e(bC _ _ (o z)).1,λs E G=>?_⟩ .rw[dT,AL h,dn _ _ _ _ А];simp only[cU,p];exact u .rcases Nat.eq_or_lt_of_le E with rfl | H .exact ⟨А,А,λz=>(bC _ _ (o z)).2⟩ .exact v s H G lemma gn (u:0 Aв<=(kY (fa s))в/\(jL (fa s))в<= Mв/\(O=0-> fa s=0)) (b:dE m L (Dense.F.ab (λt=>pT (Dense.F.dw jR) (fa t)) n 1 (pT (Dense.F.dw jR) (fa 0))) O A M<Ж): co (dE m L (Dense.F.ab (λt=>pT (Dense.F.dw jR) (fa t)) n 1 (pT (Dense.F.dw jR) (fa 0))) O A M)ж d=av n fa d:=by unfold dE at b⊢;split .rename_i H rw[bl _ d j,show (0:Д)ж=0 from rfl,aX _ d (.inl rfl) j.2.1 (lE j.2.2) j.1];exact (iE _ d _ u j λt l=>(h t l).2.2 H).symm rename_i D;rw[AB D] at b split at b;swap;. simp at b rename_i w;rw[AD w];have r:=Ζ.mp w;simp only[jN] at r;split at b .rename_i p rw[AD p];have q:=Ζ.mp p;rw[Ϲ] at q have:=iS fa n (Aв-1) (2^(24+mв)) u (λt l=>gU _ Aв Mв mв А А (h t l).1 (h t l).2.1) v А b unfold av;rw[bl _ d j,this] rename_i p;rw[AB p] split at b;swap;. simp at b rename_i x;rw[AD x] have G:(120+(Mв-1)+2*L).toUInt64б=174+(Mв-1)+2*L-54:=by rw[lC,Ε (by simp only[j6];omega)];omega have E:∀t,t jL (fa t)≠255/\jS (fa t)<= Mв-1:=λt l=>by have g:=(h t l).2.1;have I:=Dense.aS (fa t);refine ⟨λe=>?_,А⟩ rw[e] at g;simp at g;omega have:=cQ n fa u (Mв-1) L E B o x.2 _ G b;unfold av;rw[bl _ d j,this] @[inline] def fX (sp:п) (L:м) (q:р) (ch y x:м):п:= let U:=(ch*h+y*k)*w+x*k if hg:0I[(b*h+y*w)*w+x*w+t]!:=funext λt=>by rw[<- ep,lb ((b*h+y*w)*w+x*w),Ϩ (t/w),Nat.div_add_mod] have l:I.uget ((b*h+y*w)*w+x*w)д (by rw[aa _ А];omega)=I[(b*h+y*w)*w+x*w]!:=by rw[cU,aa _ А] simp only[l] obtain ⟨u,q,r,D,v,E,G,H⟩:=gI I j L (Dense.F.dw jR) ((b*h+y*w)*w+x*w) (w*w) (((b*h+y*w)*w+x*w)+w*w)д (by rw[aa _ А];exact O.2.1) (aa _ А) _ 1 (((b*h+y*w)*w+x*w)д+1) (pT (Dense.F.dw jR) I[(b*h+y*w)*w+x*w]!) I[(b*h+y*w)*w+x*w]! (kY I[(b*h+y*w)*w+x*w]!) (jL I[(b*h+y*w)*w+x*w]!) rfl (by rw[Dense.ac (by rw[aa _ А];simp;omega),aa _ А];simp) B have p:∀s,s qв<=(kY I[(b*h+y*w)*w+x*w+s]!)в/\(jL I[(b*h+y*w)*w+x*w+s]!)в<= rв/\(u=0-> I[(b*h+y*w)*w+x*w+s]! =0):=λs Q=>by rcases kX s with rfl | S .exact ⟨v,E,λz=>G z⟩ .exact H s S Q rw[D];split swap;. rfl rename_i M;rw[N];exact gn (w*w) (λt=>I[(b*h+y*w)*w+x*w+t]!) d B J j o g L K e u q r (AR v (bK _).1) p (by simpa using M) lemma jl (e:0 м-> м-> jJ) (g:∀b y x,f b y x=av (k*k) (mm h w k I b y x) (natW (k*k))): gN c (h/k) (w/k) f=la c h w k I:=by unfold gN la;rw[AD e,im _ _ _ _ 0 (λ_ _=>0) (λo y x _=>f o y x) e,ϐ] refine li (by simp[lP]) λq _ _=>?_ simp only[am,Ξ,lP];exact g _ _ _ @[inline] def ky (u:п):Е:=if u<0x80000000 then u+0x80000000 else 0xFFFFFFFF-u @[inline] def aN (a b:п):п:=if ky asimp_all[ν,Ϲ,ϑ]<;>omega lemma gp (a b:jJ):(ky (aN a b))в=max (ky a)в (ky b)в:=by unfold aN;split<;>rename_i h<;>rw[ν] at h<;>omega lemma gr (a b:jJ) (h:(ky a)в=(ky b)в):a=b:=by rw[be,be] at h;have:=a.toNat_lt;have:=b.toNat_lt;rw[<- η];split_ifs at h<;>omega lemma e8 (m:jL y≠255) (o:jL z≠255):mx y z=aN y z:=by have:=y.toNat_lt;have:=z.toNat_lt have F:∀a b,sk a ky aby simp only[ν,bE,be] at h⊢;have:=a.toNat_lt;have:=b.toNat_lt;split_ifs at h⊢<;>omega unfold mx aN;by_cases h:sk yh e.2.2];simp only[not_or,ν,bE] at h;obtain ⟨g,j,l⟩:=h obtain ⟨rfl,rfl⟩ | ⟨rfl,rfl⟩:(y=0/\z=0x80000000)\/(y=0x80000000/\z=0):=by simp only[<- η,jN] at l⊢;split_ifs at g j<;>omega all_goals decide @[inline] def um (a b:п):п:=if a jL b≠255-> jL (aN a b)≠255:=λa b u w=>by unfold aN;split<;>assumption have K:∀e j l m:jJ,jL e≠255-> jL j≠255-> jL l≠255-> jL m≠255 -> aN (aN e j) (aN l m)=mx (mx (mx (mx e e) j) l) m:=λe j l m g p q t=>by rw[e8 _ _ g g,e8 _ _ (o _ _ g g) p,e8 _ _ (o _ _ (o _ _ g g) p) q, e8 _ _ (o _ _ (o _ _ (o _ _ g g) p) q) t] apply gr;simp only[gp,max_self,max_assoc] unfold dL;split .rename_i h rw[ν,ϓ,ϓ,ϓ] at h have B:∀v:jJ,vв<= eв ||| jв ||| lв ||| mв-> vв<2^31/\jL v≠255:= λv O=>⟨by simp only[jN] at h;omega,λI=>by have:=Dense.aR v;rw[I,Dense.aQ] at this;simp only[jN] at this h;omega⟩ have U:∀a b:jJ,aв<2^31-> bв<2^31-> um a b=aN a b/\(um a b)в<2^31:= λa b u w=>by have x:ky al2 e (k4 (mm h w 2 I b y x t))) (k4 (mm h w 2 I b y x 0))):=by rw[m4,<- dl (mx _ _)];simp only[fw,<- ep,kB,jO,zero_mul,Am,add_zero,List.range_succ,List.range_zero,List.foldl_append,List.foldl_cons,List.foldl_nil] lemma gv {I:о jJ} {v t e:н} (b:tа+vа п-> п-> п-> п-> п) (I:о п) (v t:н) (hs:tа+vа jJ-> jJ-> jJ-> jJ-> jJ) (v t:н) (l:tа+vа jJ): ∀m (e q:н) (a:о jJ),eа+2*m=tа+1-> qа+m<= aг-> aг<2^31 -> (∀j< m,∀b:н,bа=eа+2*j-> f b I[eа+2*j]! I[eа+2*j+1]! I[eа+2*j+vа]! I[eа+2*j+vа+1]! = G (qа+j))->(bX f I v t l e q a)г=aг /\ ∀iintro e q a J F H r .rw[bX,AI (by rw[β];omega)];exact ⟨rfl,λi _=>by rw[AB А]⟩ rename_i m D;have h:e?_).imp (Eq.trans · o) λy i A=>?_ .have:=r (j+1) А b А rw[(А:eа+2*(j+1)=(e+2)а+2*j),(А:qа+(j+1)=(q+1)а+j)] at this exact this rw[y i А,B,dj];rcases eq_or_ne i qа with rfl | g<;>[rw[Ϭ _ _ _ A];rw[ϴ _ _ _ _ g.symm]]<;>split_ifs<;>first | rfl | omega lemma iM (f:н-> jJ-> jJ-> jJ-> jJ-> jJ) (g:о jJ) (A:gг=c*(h/2*(w/2))) (E:0 y j lа=(o*h+y*2)*w+j*2 -> f l I[(o*h+y*2)*w+j*2]! I[(o*h+y*2)*w+j*2+1]! I[(o*h+y*2)*w+j*2+w]! I[(o*h+y*2)*w+j*2+w+1]! = g[(o*(h/2)+y)*(w/2)+j]!): lp (h/2) (λo y a=> if H:(((o*h+y*2)*w)д+(w/2*2-1)д)а+wдаr<= c*(h/2)-> aг=c*(h/2*(w/2)) /\ ∀i?_) (c*(h/2)) 0 0 _ E (λ_=>⟨ύ ..,λi q=>by rw[AB (by simp),AF _ _ (by simpa using q),Array.getElem_replicate]⟩) (by simp)).elim λm v=>li (m.trans A.symm) λi t N=>?_ on_goal 2=>have e:=v i (m ▸ t);rw[AD (by simp only[ϖ,ϩ,ϐ];exact m ▸ t),AF,AF] at e<;>assumption obtain ⟨M,x⟩:=B А;have K:=ζ (w/2) G;rw[Β] at K;have u:o?_).imp (Eq.trans · M) λz i q=>?_ .simp (disch:=omega) only[aa] at b⊢ rw[Ϩ 2 j] at b⊢;exact D o y j l u J F b rw[z i А,x i q,Β];simp (disch:=omega) only[aa];split_ifs<;>first | rfl | omega def dd:о п:= if k=2/\0 if hs:(((o*h+y*2)*w)д+(w/2*2-1)д)а+wдаdL) I wд _ hs ((o*h+y*2)*w)д ((o*(h/2)+y)*(w/2))д a else a) (c*(h/2)) 0 0 (AK (c*(h/2*(w/2))) 0) else maxpoolSpec c h w k I lemma em:dd=maxpoolSpec:=by funext c h w k I;unfold dd;split .obtain ⟨rfl,l,q,g,b⟩:=‹_/\_› refine iM c h w I _ _ (by simp[maxpoolSpec]) l q g b λo y j t p r m _=>?_ have e:=ζ (w/2) (show o*(h/2)+y+1<= c*(h/2) by have:=ζ (h/2) p;rw[Β] at this;omega) rw[Β] at e;show dL _ _ _ _=_;rw[gs h w I o y j,maxpoolSpec,AF _ _ (by simp;rw[ϐ c] at e;omega),Ξ] simp only[aB o y j (h/2) (w/2) r m] .rfl @[noinline] def iT (I:о п) (v e:н):п:= toWord (AV (ofW (dotOf 4 (λt=>I[eа+t/2*vа+t%2]!) λ_=>oneW)) (ofW 0x40800000)) @[inline] def fL (q:р) (I:о п) (v e:н) (x0 x1 x2 x3:п):п:= let r:=xQ q x0 x1 x2 x3 if r<Ж then rж else iT I v e lemma fM (b y x:м) (e v:н) (o:eа=(b*h+y*2)*w+x*2) (r:vа=w): fL (Dense.F.dw jR) I v e I[(b*h+y*2)*w+x*2]! I[(b*h+y*2)*w+x*2+1]! I[(b*h+y*2)*w+x*2+w]! I[(b*h+y*2)*w+x*2+w+1]! =av (2*2) (mm h w 2 I b y x) 0x40800000:=by have q:=ep h w 2 I b y x;have g:=q 0;have j:=q 1;have l:=q 2;have m:=q 3;simp only[kB,jO,zero_mul,Am,add_zero] at g j l m;rw[g,j,l,m];unfold fL;dsimp only;split .rename_i p;exact iz _ p .unfold iT av;rw[o,r];congr 3;show ku 4 _ _=ku 4 _ _;congr 1;funext t;exact q t def c6:о п:= let d:=natW (k*k) let L:=Ar (k*k+1)+1 if 0 if hs:(((o*h+y*2)*w)д+(w/2*2-1)д)а+wдаfX h w k I d (29-L).toUInt32 L (Dense.F.dw oneW) ch y x else avgpoolSpec c h w k I else avgpoolSpec c h w k I lemma d8:c6=la:=by funext c h w k I;unfold c6;dsimp only;split .obtain ⟨A,p,E,t,u,e⟩:=‹_/\_› split .obtain ⟨rfl,g,D⟩:=‹_/\_› have:=bi;refine iM c h w I _ _ (by simp[la,lP]) p E D e λo y j r B G z v=>?_ have m:=ζ (w/2) (show o*(h/2)+y+1<= c*(h/2) by have:=ζ (h/2) B;rw[Β] at this;omega) rw[Β] at m;have F:w<= c*h*w:=ώ w (lN А А);rw[fM h w I o y j r _ v (aa _ А),la,lP,AF _ _ (by simp;rw[ϐ c] at m;omega),Ξ] simp only[aB o y j (h/2) (w/2) G z];rw[g] .split .rename_i l have b:(29-(kD (k*k+1)+1)).toUInt32в=29-(kD (k*k+1)+1):=by rw[Nat.toUInt32_eq,UInt32.toNat_ofNat_of_lt' (by simp only[UInt32.size];omega)] have H:k*k+1<2^(kD (k*k+1)+1):=Ϻ;refine jl c h w k I p _ λq y x=>fY h w k I _ l t _ ?_ (by rw[b];omega) _ А u q y x A rw[b,(А:24+(29-(kD (k*k+1)+1))=53-(kD (k*k+1)+1))] calc k*k*2^(53-(kD (k*k+1)+1))<2^(kD (k*k+1)+1)*2^(53-(kD (k*k+1)+1)):= ϡ А В _=2^53:=by rw[<- AM];congr 1;omega .rfl .rfl end Conv namespace ZF open Dense.F lemma iJ (x y:р) (h:fv (x*y)):fv x/\fv y:=by rw[bA] at h;rw[bA,bA] change (kA (jT j4 x.toModel.unpack y.toModel.unpack)).unpack.isFinite=true at h generalize x.toModel.unpack=X at h⊢;generalize y.toModel.unpack=Y at h⊢ cases X<;>cases Y<;>simp_all[jT,jZ,ma, kA,ϝ,Ϧ] lemma iH (x y:р) (h:fv (x+y)):fv x/\fv y:=by rw[bA] at h;rw[bA,bA] change (kA (kF j4 x.toModel.unpack y.toModel.unpack)).unpack.isFinite=true at h generalize x.toModel.unpack=X at h⊢;generalize y.toModel.unpack=Y at h⊢ cases X<;>cases Y<;>simp_all[kF,jZ,ma, kA,ϝ,Ϧ]<;>split_ifs at h<;> simp_all[jZ,ϝ,Ϧ] def cR:р:=Float.ofBits 0x7FF8000000000000 lemma gx:¬fv cR:=by unfold fv;rw[eU];rw[lh _ _ _ _ (fq cR).1 (fq cR).2];have b:FloatFormat.binary64.expAllOnesNat=2047:=Б simp only[show FloatFormat.binary64.encoding=.ieee from rfl,b, show cR.toBits=0x7FF8000000000000 by decide] decide def z0:р:=(0:Int64).toFloat def sp (ng:т) (k:м):р:=if ng then nm*pw k else pw k def T:FloatArray:=⟨Aa (n:=1024) λi=> if iи/2%256=255 then cR else if iи%2=1/\iи/2%256=0 then z0 else sp (decide (512<= iи)) (if iи%2=0 then iи/2%256-1 else iи/2%256+22)⟩ lemma ag:Tе=1024:=by simp[T,kJ] lemma cY (i:н) (h:iа>>23)к<<<1)а=2*(wв/2^23):=by have:=w.toNat_lt;rw[USize.toNat_shiftLeft,Dense.aT,eu,ϔ] rcases kV with h | h<;>rw[h]<;>simp only[jO,χ,pow_one]<;> rw[ι А]<;>omega lemma fo (w:jJ):((w>>>23)к<<<1+1)а=2*(wв/2^23)+1:=by have:=w.toNat_lt;have:=ε;rw[Dense.ac (by rw[zk];simp only[ϔ];omega),zk];simp @[inline] def dz (T:@& FloatArray) (hT:Tе=1024) (w:п):р:= let k:=(w>>>23)к<<<1 (w&&&8388607)л.toInt64.toFloat*T.uget k (by rw[hT,zk];have:=w.toNat_lt;omega)+ T.uget (k+1) (by rw[hT,fo];have:=w.toNat_lt;omega) lemma iU (b:т) (k:м) (l:k<=900): fv (sp b k)/\rv (sp b k)=((if b then-1 else 1:с):ℝ)*2^k:=by obtain ⟨g,h⟩:=gF k l;cases b .simp only[sp,ς,↓reduceIte,Int.cast_one,Am];exact ⟨g,h⟩ .have e:=dH (-1) Б obtain ⟨j,m⟩:=aZ _ _ e.1 g (-1) (k:м) (by rw[e.2,h,AA];rfl) Б А (b0 1 _ 971 А AJ _ Б) simp only[sp,↓reduceIte];exact ⟨j,by rw[show nm=(-1:Int64).toFloat from rfl,m,AA]⟩ lemma d7 (x y:р) (l:fv x) (m:fv y) (z e:с) (b:rv x+rv y=(z:ℝ)*(2:ℝ)^e) (j:zз<2^53) (h:-1074<= e) (g: |(z:ℝ)*(2:ℝ)^e| <= (2:ℝ)^(971:с)): fv (x+y)/\rv (x+y)=(z:ℝ)*(2:ℝ)^e:=by have:=fU x y l m (ka z e) (by rw[al,b]) j h (by rw[al];exact g) exact ⟨this.1,by rw[this.2,b]⟩ lemma Te (w:jJ) (g:jL w≠255) (h0 h1): T.uget ((w>>>23)к<<<1) h0=sp (j5 w) ((jL w)в-1) /\ T.uget ((w>>>23)к<<<1+1) h1=if jL w=0 then z0 else sp (j5 w) ((jL w)в+22):=by rw[cY,cY,zk,fo];have o:=w.toNat_lt;have p:=Dense.bS w;have m:=Dense.ax w;have b:(jL w)в≠255:=λh=>g (η.mp (by rw[h];rfl)) have e:decide (512<=2*(wв/2^23)+1)=j5 w/\decide (512<=2*(wв/2^23))=j5 w:=by constructor<;>rw[ϛ,decide_eq_true_iff,ay]<;>omega have l:jL w=0↔(jL w)в=0:=⟨λh=>by rw[h];rfl,λh=>η.mp (by rw[h];rfl)⟩ rw[e.1,e.2];simp only[l];generalize (jL w)в=E at* generalize wв/2^23=j at* rw[(А:2*j/2%256=E),(А:(2*j+1)/2%256=E),Nat.mul_mod_right, show (2*j+1)%2=1 by omega] constructor<;>simp[b] lemma gk (w:jJ) (y:jL w≠255):fv (dz T ag w)/\rv (dz T ag w)=(sv w:ℝ)*2^jS w:=by unfold dz;dsimp only;obtain ⟨o,p⟩:=Te w y (by rw[ag,zk];have:=w.toNat_lt;omega) (by rw[ag,fo];have:=w.toNat_lt;omega) rw[o,p,Dense.aS];have E:=Dense.ax w;have z:(kc w)в<2^23:=by unfold kc;rw[Dense.ei];omega obtain ⟨u,D⟩:=mV ((w&&&8388607)л) (kc w)в (by simp[kc]) А obtain ⟨q,m⟩:=iU (j5 w) ((jL w)в-1) А;have e:sv w=(if j5 w then-1 else 1:с)*jX w:=by unfold sv;split<;>simp have g:(kc w)в<= jX w:=by unfold jX;split<;>omega generalize l:(if j5 w then-1 else 1:с)=σ at m e;have j:(σ*(kc w)в)з<2^24:=by rw[ϙ,<- l];split<;>simp<;>omega obtain ⟨r,A⟩:=aZ _ _ u q (σ*(kc w)в) (((jL w)в-1:м):с) (by rw[D,m,AA];push_cast;ring) (j.trans Г) А (b0 24 _ 971 А AJ _ j) obtain ⟨t,B⟩:fv (if jL w=0 then z0 else sp (j5 w) ((jL w)в+22)) /\ rv (if jL w=0 then z0 else sp (j5 w) ((jL w)в+22))= ((σ*(jX w-(kc w)в:м):с):ℝ)*2^((jL w)в-1):=by unfold jX;split .have:=dH 0 Б;exact ⟨this.1,by rw[show z0=(0:Int64).toFloat from rfl,this.2];simp⟩ .rename_i x have:(jL w)в≠0:=λh=>x (η.mp (by rw[h];rfl)) obtain ⟨f,v⟩:=iU (j5 w) ((jL w)в+22) А;rw[l] at v;refine ⟨f,?_⟩;rw[v,(А:(jL w)в+22=(jL w)в-1+23),AM,A1] push_cast;ring have b:=cy w refine (d7 _ _ r t (sv w) (((jL w)в-1:м):с) ?_ (b.trans Г) А (b0 24 _ 971 А AJ _ b)).imp id (λh=>by rw[h,AA]) rw[A,B,e,AA,Nat.cast_sub g];push_cast;ring lemma gj (w:jJ) (h:fv (dz T ag w)):jL w≠255:=by intro g;unfold dz at h;dsimp only at h;have b:=(iH _ _ h).2;rw[cY,fo] at b;have j:=w.toNat_lt;have e:=Dense.bS w;rw[AD (by rw[g] at e;simp only[jN] at e;omega)] at b exact gx b @[noinline] def dp (relu:т) (w s t:п):п:=act relu (toWord (Ak (ofW w) (ofW s) (ofW t))) def bI:р:=pw 149 lemma jz (b:Д):((b>>>32)ж&&&0x80000000)в=2^31*(bб/2^63):=by have e:=b.toNat_lt;rw[ξ,Ν,ψ,δ];change (bб/2^32%2^32)&&&2^31=2^31*(bб/2^63);rw[kH,ϕ];have:bб/2^32%2^32/2^31%2=bб/2^63:=А;rw[this];rcases (А:bб/2^63=0\/bб/2^63=1) with h | h<;>rw[h]<;>rfl lemma iL (b:Д) (m:jJ) (e:mв<2^31): (m ||| ((b>>>32)ж&&&0x80000000))в=mв+2^31*(bб/2^63):=by rw[ϓ,jz,Nat.lor_comm,<- ϊ e];ring lemma jD (b:Д) (g:(b<<<1)-((1195:Д)<<<53)<((253:Д)<<<53)) (e:((b+268435458)&&&536870911)>=5): 1195<=(eF b)б/\(eF b)б<=1447/\3<=((b&&&0xfffffffffffff)б+2^28)%2^29 /\ ((b&&&0xfffffffffffff)б+2^28)%2^29+2<2^29 /\ (((b+268435456)>>>29)ж-((170:Е)<<<23))в= ((eF b)б-1195)*2^23+(2^23+((b&&&0xfffffffffffff)б+2^28)/2^29) /\ ((b&&&0xfffffffffffff)б+2^28)/2^29<=2^23:=by have:=b.toNat_lt simp only[θ,τ,Τ,υ, μ,ο,ψ,ϑ,Ν, ϲ,eF,jI,jN,jO,χ, δ,ge_iff_le] at g e⊢ rw[γ _ 29] at e;rw[γ _ 11,γ _ 52];generalize bб=n at* omega lemma jo (o:jJ) (b:oв%2^31<255*2^23):jL o≠255:=λh=>by have:=Dense.bS o;simp[h] at this;omega lemma jn (s t w:jJ) (S:р) (M:dz T ag w*dz T ag s+dz T ag t*pw 149=S) (B:(S.toBits<<<1)-((1195:Д)<<<53)<((253:Д)<<<53)) (D:((S.toBits+268435458)&&&536870911)>=5): (((S.toBits+268435456)>>>29)ж-((170:Е)<<<23))в<255*2^23 /\ (((S.toBits+268435456)>>>29)ж-((170:Е)<<<23)) ||| ((S.toBits>>>32)ж&&&0x80000000)= jW (Ak (k4 w) (k4 s) (k4 t)):=by obtain ⟨q,r,h,j,v,hq⟩:=jD _ B D have x:(((S.toBits+268435456)>>>29)ж-((170:Е)<<<23))в<255*2^23:=by rw[v];clear v B D h j;generalize (eF S.toBits)б=E at*;omega refine ⟨x,?_⟩;subst M;have m:=iI (dz T ag w*dz T ag s+dz T ag t*pw 149) А;obtain ⟨o,L⟩:=iH _ _ m;obtain ⟨K,p⟩:=iJ _ _ o;have l:=gj w K;have b:=gj s p;have g:=gj t (iJ _ _ L).1;obtain ⟨G,Q⟩:=gk w l;obtain ⟨H,R⟩:=gk s b;obtain ⟨I,U⟩:=gk t g;obtain ⟨J,V⟩:=gF 149 А;have iw:=Dense.aS w;have is:=Dense.aS s;have it:=Dense.aS t;have ew:=Dense.ax w;have Y:=Dense.ax s;have Z:=Dense.ax t have F:(sv w*sv s)з<2^48:=by rw[ϙ];exact (lf (cy w) (cy s)).trans_eq Г obtain ⟨z,W⟩:=aZ _ _ G H (sv w*sv s) ((jS w+jS s:м):с) (by rw[Q,R,AA,AM];push_cast;ring) (lt_trans F Г) А (b0 48 _ 971 А AJ _ F) obtain ⟨A,X⟩:=aZ _ _ I J (sv t) ((jS t+149:м):с) (by rw[U,V,AA,AM];ring) ((cy t).trans Г) А (b0 24 _ 971 А AJ _ (cy t)) have O:=iO _ _ z A m _ А А (eG _ m);obtain ⟨-,e⟩:=eg _ _ z A _ А А O have N:rv (dz T ag w*dz T ag s)+rv (dz T ag t*pw 149)= ((sv w*sv s*2^(jS w+jS s)+sv t*2^(jS t+149):с):ℝ):=by rw[W,X,AA,AA];push_cast;ring rw[N] at e;generalize dz T ag w*dz T ag s+dz T ag t*pw 149=S at* obtain ⟨u,y⟩:=cE _ m 2 Г _ q r h j (e.trans (by rw[show (((eF S.toBits)б:с)-1022-53)=((eF S.toBits)б:с)-1075 by ring] have hp:=Ao (show (0:ℝ)<2 by norm_num) (((eF S.toBits)б:с)-1075) push_cast;linarith)) rw[dF w s t l b g _ rfl u];exact η.mp (by rw[iL _ _ А,v,y];ring) @[inline] def eC (b:Д) (m:п):п:=m&&&((b>>>63)ж-1) @[inline] def iC (b:Д) (m:п):п:=m ||| ((b>>>32)ж&&&0x80000000) @[inline] def e2 (T:@& FloatArray) (hT:Tе=1024) (act:Д-> п-> п) (relu:т) (Y Z:р) (s t:п) (w:п):п:= let b:=(dz T hT w*Y+Z).toBits if (b<<<1)-((1195:Д)<<<53)<((253:Д)<<<53) then if ((b+268435458)&&&536870911)>=5 then act b (((b+268435456)>>>29)ж-((170:Е)<<<23)) else dp relu w s t else dp relu w s t lemma fO (b:Д) (m:jJ) (p:mв<255*2^23): eC b m=mc true (m ||| ((b>>>32)ж&&&0x80000000)):=by have l:=b.toNat_lt;have g:=iL b m А;generalize m ||| ((b>>>32)ж&&&0x80000000)=o at g⊢;have j:jL o≠255:=jo o (by rw[g];omega) unfold eC mc reluW simp only[↓reduceIte,Bn.NativeAdd.gM,j,Av,Bool.false_and,Bool.not_false,Bool.and_true, AO] apply η.mp;rcases (А:bб/2^63=0\/bб/2^63=1) with h | h .have e:(b>>>63)ж=0:=η.mp (by simp[δ];omega) rw[e,AB А,ξ];change mв&&&(2^32-1)=oв;rw[γ,ι А];omega .have e:(b>>>63)ж=1:=η.mp (by simp[δ];omega) rw[e,AD А];simp lemma bv (h:Д-> jJ-> jJ) (e:т) (g:∀b m,mв<255*2^23-> h b m=mc e (m ||| ((b>>>32)ж&&&0x80000000))) (s t w:jJ):e2 T ag h e (dz T ag s) (dz T ag t*bI) s t w=dp e w s t:=by unfold e2 bI;dsimp only;split;swap;rfl;split;swap;rfl;obtain ⟨j,l⟩:=jn s t w _ rfl ‹_› ‹_›;unfold dp;rw[<- l];exact g _ _ j @[specialize] def cl (T:@& FloatArray) (hT:Tе=1024) (K:р) (af:Д-> п-> п) (relu:т) (hw c:м) (s t:о п) (ch:м) (x:о п):о п:= if che2 T hT af relu Y Z sc tc w) (ch*hw)д x h else x) else x termination_by c-ch lemma d9 (p:Д-> jJ-> jJ) (e:т) (o:∀b m,mв<255*2^23-> p b m=mc e (m ||| ((b>>>32)ж&&&0x80000000))) (h c:м) (s t:о jJ) (l:м) (x:о jJ) (u:xг=c*h) (v:c*hmc e (jW (Ak (k4 w) (k4 s[j/h]!) (k4 t[j/h]!)))) else x[j]?:=by induction hk:c-l generalizing l x with | zero=> rw[cl,AB А];split;swap;rfl;rw[ϳ (by have:=ζ h (by omega:c<= l);omega)];rfl | succ k z=> have y:l*h+h<= c*h:=by rw[<- Θ];exact ζ _ А have g:=Dense.aa (n:=l*h+h) А;rw[cl,AD А];dsimp only;rw[AL (by rw[g];omega)] obtain ⟨q,r⟩:=ca _ _ (λ_ w=>dp e w s[l]! t[l]!) (λ_ _ w=>bv p e o _ _ w) _ x (by rw[g];omega) rw[z (l+1) _ (by rw[q,u]) А,r,Dense.aa А,g,Θ] split_ifs<;>first | omega | rw[Nat.div_eq_of_lt_le (k:=l) А (by rw[Θ];omega)];rfl | rfl def f5 (relu:т) (c hw:м) (x s t:о п):о п:= if xг=c*hw/\c*hw l b m=mc e (m ||| ((b>>>32)ж&&&0x80000000))) -> cl T ag bI l e p c s t 0 x=lQ e c p x s t:=λl g=> l9 λj=>by rw[d9 l e g _ _ _ _ 0 x h.1 h.2,AD (by simp),lQ,lT] split .rw[Ϫ А,AF x j А];rfl .rw[ϳ А];rfl cases e .exact o iC λ_ _ _=>rfl .exact o eC fO end ZF def kernels:Kernels where core:=⟨sumSpec,dotSpec⟩ dense:=⟨Dense.cv,gemmSpec⟩ conv:=⟨Conv.dv,Conv.bT⟩ elem:=⟨Conv.c6,Conv.dd,Bn.bJ,ZF.f5⟩ norm:=specNorm theorem correct:Obligation kernels:=by simp only[Obligation,kernels,specKernels,specCore,specDense,specConv,specElem,specNorm, Dense.dI,Conv.dy,Conv.cn,Conv.em,Conv.d8,cZ,ZF.f6] end Submission