Beginning of Section A11781
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.
L9Variable F0 : set → set → set
L10Hypothesis HF0 : ∀x0 ∈ int, ∀x1 ∈ int, F0 x0 x1 ∈ int
L11Variable G0 : set → set
L12Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L14Hypothesis HH0 : H0 ∈ int
L15Variable U0 : set → set → set
L16Hypothesis HU0 : ∀x0 ∈ int, ∀x1 ∈ int, U0 x0 x1 ∈ int
L17Variable V0 : set → set
L18Hypothesis HV0 : ∀x0 ∈ int, V0 x0 ∈ int
L19Variable SMALL : set → set
L20Hypothesis HSMALL : ∀x0 ∈ int, SMALL x0 ∈ int
L21Variable F1 : set → set → set
L22Hypothesis HF1 : ∀x0 ∈ int, ∀x1 ∈ int, F1 x0 x1 ∈ int
L23Variable G1 : set → set → set
L24Hypothesis HG1 : ∀x0 ∈ int, ∀x1 ∈ int, G1 x0 x1 ∈ int
L25Variable H1 : set → set
L26Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int
L28Hypothesis HI1 : I1 ∈ int
L30Hypothesis HJ1 : J1 ∈ int
L31Variable U1 : set → set → set → set
L32Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U1 x0 x1 x2 ∈ int
L33Variable V1 : set → set → set → set
L34Hypothesis HV1 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V1 x0 x1 x2 ∈ int
L35Variable W1 : set → set
L36Hypothesis HW1 : ∀x0 ∈ int, W1 x0 ∈ int
L37Variable F2 : set → set → set
L38Hypothesis HF2 : ∀x0 ∈ int, ∀x1 ∈ int, F2 x0 x1 ∈ int
L39Variable G2 : set → set → set
L40Hypothesis HG2 : ∀x0 ∈ int, ∀x1 ∈ int, G2 x0 x1 ∈ int
L41Variable H2 : set → set
L42Hypothesis HH2 : ∀x0 ∈ int, H2 x0 ∈ int
L44Hypothesis HI2 : I2 ∈ int
L46Hypothesis HJ2 : J2 ∈ int
L47Variable U2 : set → set → set → set
L48Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U2 x0 x1 x2 ∈ int
L49Variable V2 : set → set → set → set
L50Hypothesis HV2 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V2 x0 x1 x2 ∈ int
L51Variable W2 : set → set
L52Hypothesis HW2 : ∀x0 ∈ int, W2 x0 ∈ int
L53Variable FAST : set → set
L54Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L55Hypothesis H1 : (∀X ∈ int, (∀Y ∈ int, ((F0 X Y) = ((1 + 2) * ((2 * (X * Y)) + - X)))))
L56Hypothesis H2 : (∀X ∈ int, ((G0 X) = X))
L57Hypothesis H3 : (H0 = 1)
L58Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y) X)))))
L59Hypothesis H5 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) H0)))
L60Hypothesis H6 : (∀X ∈ int, ((SMALL X) = (V0 X)))
L61Hypothesis H7 : (∀X ∈ int, (∀Y ∈ int, ((F1 X Y) = (X * Y))))
L62Hypothesis H8 : (∀X ∈ int, (∀Y ∈ int, ((G1 X Y) = (2 + Y))))
L63Hypothesis H9 : (∀X ∈ int, ((H1 X) = (X + - 1)))
L64Hypothesis H10 : (I1 = 1)
L65Hypothesis H11 : (J1 = (1 + 2))
L66Hypothesis H12 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((U1 X Y Z) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y Z) (V1 (X + - 1) Y Z)))))))
L67Hypothesis H13 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((V1 X Y Z) = (if (X <= 0) then Z else (G1 (U1 (X + - 1) Y Z) (V1 (X + - 1) Y Z)))))))
L68Hypothesis H14 : (∀X ∈ int, ((W1 X) = (U1 (H1 X) I1 J1)))
L69Hypothesis H15 : (∀X ∈ int, (∀Y ∈ int, ((F2 X Y) = (X * Y))))
L70Hypothesis H16 : (∀X ∈ int, (∀Y ∈ int, ((G2 X Y) = Y)))
L71Hypothesis H17 : (∀X ∈ int, ((H2 X) = X))
L72Hypothesis H18 : (I2 = 1)
L73Hypothesis H19 : (J2 = (1 + 2))
L74Hypothesis H20 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((U2 X Y Z) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y Z) (V2 (X + - 1) Y Z)))))))
L75Hypothesis H21 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((V2 X Y Z) = (if (X <= 0) then Z else (G2 (U2 (X + - 1) Y Z) (V2 (X + - 1) Y Z)))))))
L76Hypothesis H22 : (∀X ∈ int, ((W2 X) = (U2 (H2 X) I2 J2)))
L77Hypothesis H23 : (∀X ∈ int, ((FAST X) = ((W1 X) * (W2 X))))
L78Theorem. (
A11781)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
Proof: Proof not loaded.