Beginning of Section A9966
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 F1 : setsetset
Hypothesis HF1 : ∀x0int, ∀x1int, F1 x0 x1 int
Variable G1 : set
Hypothesis HG1 : G1 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 F0 : setset
Hypothesis HF0 : ∀x0int, F0 x0 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 F2 : setsetset
Hypothesis HF2 : ∀x0int, ∀x1int, F2 x0 x1 int
Variable G2 : setsetset
Hypothesis HG2 : ∀x0int, ∀x1int, G2 x0 x1 int
Variable H2 : setset
Hypothesis HH2 : ∀x0int, H2 x0 int
Variable I2 : set
Hypothesis HI2 : I2 int
Variable J2 : set
Hypothesis HJ2 : J2 int
Variable U2 : setsetsetset
Hypothesis HU2 : ∀x0int, ∀x1int, ∀x2int, U2 x0 x1 x2 int
Variable V2 : setsetsetset
Hypothesis HV2 : ∀x0int, ∀x1int, ∀x2int, V2 x0 x1 x2 int
Variable W2 : setset
Hypothesis HW2 : ∀x0int, W2 x0 int
Variable F3 : setset
Hypothesis HF3 : ∀x0int, F3 x0 int
Variable G3 : setset
Hypothesis HG3 : ∀x0int, G3 x0 int
Variable H3 : set
Hypothesis HH3 : H3 int
Variable U3 : setsetset
Hypothesis HU3 : ∀x0int, ∀x1int, U3 x0 x1 int
Variable V3 : setset
Hypothesis HV3 : ∀x0int, V3 x0 int
Variable FAST : setset
Hypothesis HFAST : ∀x0int, FAST x0 int
Hypothesis H1 : (∀Xint, (∀Yint, ((F1 X Y) = (X * Y))))
Hypothesis H2 : (G1 = (2 + 2))
Hypothesis H3 : (∀Xint, ((H1 X) = X))
Hypothesis H4 : (∀Xint, (∀Yint, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y) X)))))
Hypothesis H5 : (∀Xint, ((V1 X) = (U1 G1 (H1 X))))
Hypothesis H6 : (∀Xint, ((F0 X) = (((V1 X) + - X) + - X)))
Hypothesis H7 : (∀Xint, ((G0 X) = X))
Hypothesis H8 : (H0 = 1)
Hypothesis H9 : (∀Xint, (∀Yint, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y))))))
Hypothesis H10 : (∀Xint, ((V0 X) = (U0 (G0 X) H0)))
Hypothesis H11 : (∀Xint, ((SMALL X) = (V0 X)))
Hypothesis H12 : (∀Xint, (∀Yint, ((F2 X Y) = (X * Y))))
Hypothesis H13 : (∀Xint, (∀Yint, ((G2 X Y) = Y)))
Hypothesis H14 : (∀Xint, ((H2 X) = (X + - 1)))
Hypothesis H15 : (I2 = 1)
Hypothesis H16 : (J2 = (1 + (2 + (2 * (2 + 2)))))
Hypothesis H17 : (∀Xint, (∀Yint, (∀Zint, ((U2 X Y Z) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y Z) (V2 (X + - 1) Y Z)))))))
Hypothesis H18 : (∀Xint, (∀Yint, (∀Zint, ((V2 X Y Z) = (if (X <= 0) then Z else (G2 (U2 (X + - 1) Y Z) (V2 (X + - 1) Y Z)))))))
Hypothesis H19 : (∀Xint, ((W2 X) = (U2 (H2 X) I2 J2)))
Hypothesis H20 : (∀Xint, ((F3 X) = (X + X)))
Hypothesis H21 : (∀Xint, ((G3 X) = X))
Hypothesis H22 : (H3 = 1)
Hypothesis H23 : (∀Xint, (∀Yint, ((U3 X Y) = (if (X <= 0) then Y else (F3 (U3 (X + - 1) Y))))))
Hypothesis H24 : (∀Xint, ((V3 X) = (U3 (G3 X) H3)))
Hypothesis H25 : (∀Xint, ((FAST X) = ((W2 X) * ((if (X <= 0) then 1 else (1 + (2 + (2 * (2 + 2))))) * (V3 X)))))
Theorem. (A9966)
(∀Nint, ((0 <= N)((SMALL N) = (FAST N))))
Proof:
The rest of the proof is missing.

End of Section A9966