Beginning of Section A34910
Notation. We use - as a prefix operator with priority 358 corresponding to applying term minus_SNo.
Notation. We use + as an infix operator with priority 360 and which associates to the right corresponding to applying term add_SNo.
Notation. We use * as an infix operator with priority 355 and which associates to the right corresponding to applying term mul_SNo.
Notation. We use < as an infix operator with priority 490 and no associativity corresponding to applying term SNoLt.
Notation. We use <= as an infix operator with priority 490 and no associativity corresponding to applying term SNoLe.
Variable F0 : setsetset
Hypothesis HF0 : ∀x0int, ∀x1int, F0 x0 x1 int
Variable G0 : setset
Hypothesis HG0 : ∀x0int, G0 x0 int
Variable H0 : set
Hypothesis HH0 : H0 int
Variable U0 : setsetset
Hypothesis HU0 : ∀x0int, ∀x1int, U0 x0 x1 int
Variable V0 : setset
Hypothesis HV0 : ∀x0int, V0 x0 int
Variable SMALL : setset
Hypothesis HSMALL : ∀x0int, SMALL x0 int
Variable F1 : setset
Hypothesis HF1 : ∀x0int, F1 x0 int
Variable G1 : set
Hypothesis HG1 : G1 int
Variable F2 : setset
Hypothesis HF2 : ∀x0int, F2 x0 int
Variable G2 : setset
Hypothesis HG2 : ∀x0int, G2 x0 int
Variable H2 : set
Hypothesis HH2 : H2 int
Variable U2 : setsetset
Hypothesis HU2 : ∀x0int, ∀x1int, U2 x0 x1 int
Variable V2 : setset
Hypothesis HV2 : ∀x0int, V2 x0 int
Variable H1 : setset
Hypothesis HH1 : ∀x0int, H1 x0 int
Variable U1 : setsetset
Hypothesis HU1 : ∀x0int, ∀x1int, U1 x0 x1 int
Variable V1 : setset
Hypothesis HV1 : ∀x0int, V1 x0 int
Variable F3 : setsetset
Hypothesis HF3 : ∀x0int, ∀x1int, F3 x0 x1 int
Variable G3 : setsetset
Hypothesis HG3 : ∀x0int, ∀x1int, G3 x0 x1 int
Variable H3 : setset
Hypothesis HH3 : ∀x0int, H3 x0 int
Variable I3 : set
Hypothesis HI3 : I3 int
Variable J3 : set
Hypothesis HJ3 : J3 int
Variable U3 : setsetsetset
Hypothesis HU3 : ∀x0int, ∀x1int, ∀x2int, U3 x0 x1 x2 int
Variable V3 : setsetsetset
Hypothesis HV3 : ∀x0int, ∀x1int, ∀x2int, V3 x0 x1 x2 int
Variable W3 : setset
Hypothesis HW3 : ∀x0int, W3 x0 int
Variable FAST : setset
Hypothesis HFAST : ∀x0int, FAST x0 int
Hypothesis H1 : (∀Xint, (∀Yint, ((F0 X Y) = (2 * (2 * ((2 * (X * Y)) + X))))))
Hypothesis H2 : (∀Xint, ((G0 X) = X))
Hypothesis H3 : (H0 = 1)
Hypothesis H4 : (∀Xint, (∀Yint, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y) X)))))
Hypothesis H5 : (∀Xint, ((V0 X) = (U0 (G0 X) H0)))
Hypothesis H6 : (∀Xint, ((SMALL X) = (V0 X)))
Hypothesis H7 : (∀Xint, ((F1 X) = (X * X)))
Hypothesis H8 : (G1 = 1)
Hypothesis H9 : (∀Xint, ((F2 X) = (X + X)))
Hypothesis H10 : (∀Xint, ((G2 X) = X))
Hypothesis H11 : (H2 = 1)
Hypothesis H12 : (∀Xint, (∀Yint, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y))))))
Hypothesis H13 : (∀Xint, ((V2 X) = (U2 (G2 X) H2)))
Hypothesis H14 : (∀Xint, ((H1 X) = (V2 X)))
Hypothesis H15 : (∀Xint, (∀Yint, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y))))))
Hypothesis H16 : (∀Xint, ((V1 X) = (U1 G1 (H1 X))))
Hypothesis H17 : (∀Xint, (∀Yint, ((F3 X Y) = (X * Y))))
Hypothesis H18 : (∀Xint, (∀Yint, ((G3 X Y) = (2 + Y))))
Hypothesis H19 : (∀Xint, ((H3 X) = X))
Hypothesis H20 : (I3 = 1)
Hypothesis H21 : (J3 = (1 + 2))
Hypothesis H22 : (∀Xint, (∀Yint, (∀Zint, ((U3 X Y Z) = (if (X <= 0) then Y else (F3 (U3 (X + - 1) Y Z) (V3 (X + - 1) Y Z)))))))
Hypothesis H23 : (∀Xint, (∀Yint, (∀Zint, ((V3 X Y Z) = (if (X <= 0) then Z else (G3 (U3 (X + - 1) Y Z) (V3 (X + - 1) Y Z)))))))
Hypothesis H24 : (∀Xint, ((W3 X) = (U3 (H3 X) I3 J3)))
Hypothesis H25 : (∀Xint, ((FAST X) = ((V1 X) * (W3 X))))
Theorem. (A34910)
(∀Nint, ((0 <= N)((SMALL N) = (FAST N))))
Proof:
The rest of the proof is missing.

End of Section A34910