Beginning of Section A1579
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
L10Hypothesis HF0 : ∀x0 ∈ int, F0 x0 ∈ int
L11Variable G0 : set → set
L12Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L13Variable F1 : set → set
L14Hypothesis HF1 : ∀x0 ∈ int, F1 x0 ∈ int
L15Variable G1 : set → set
L16Hypothesis HG1 : ∀x0 ∈ int, G1 x0 ∈ int
L18Hypothesis HH1 : H1 ∈ int
L19Variable U1 : set → set → set
L20Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L21Variable V1 : set → set
L22Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int
L23Variable H0 : set → set
L24Hypothesis HH0 : ∀x0 ∈ int, H0 x0 ∈ int
L25Variable U0 : set → set → set
L26Hypothesis HU0 : ∀x0 ∈ int, ∀x1 ∈ int, U0 x0 x1 ∈ int
L27Variable V0 : set → set
L28Hypothesis HV0 : ∀x0 ∈ int, V0 x0 ∈ int
L29Variable F2 : set → set
L30Hypothesis HF2 : ∀x0 ∈ int, F2 x0 ∈ int
L31Variable G2 : set → set
L32Hypothesis HG2 : ∀x0 ∈ int, G2 x0 ∈ int
L34Hypothesis HH2 : H2 ∈ int
L35Variable U2 : set → set → set
L36Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int
L37Variable V2 : set → set
L38Hypothesis HV2 : ∀x0 ∈ int, V2 x0 ∈ int
L39Variable SMALL : set → set
L40Hypothesis HSMALL : ∀x0 ∈ int, SMALL x0 ∈ int
L41Variable F3 : set → set → set
L42Hypothesis HF3 : ∀x0 ∈ int, ∀x1 ∈ int, F3 x0 x1 ∈ int
L43Variable G3 : set → set → set
L44Hypothesis HG3 : ∀x0 ∈ int, ∀x1 ∈ int, G3 x0 x1 ∈ int
L45Variable H3 : set → set
L46Hypothesis HH3 : ∀x0 ∈ int, H3 x0 ∈ int
L48Hypothesis HI3 : I3 ∈ int
L50Hypothesis HJ3 : J3 ∈ int
L51Variable U3 : set → set → set → set
L52Hypothesis HU3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U3 x0 x1 x2 ∈ int
L53Variable V3 : set → set → set → set
L54Hypothesis HV3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V3 x0 x1 x2 ∈ int
L55Variable W3 : set → set
L56Hypothesis HW3 : ∀x0 ∈ int, W3 x0 ∈ int
L57Variable F4 : set → set → set
L58Hypothesis HF4 : ∀x0 ∈ int, ∀x1 ∈ int, F4 x0 x1 ∈ int
L59Variable G4 : set → set → set
L60Hypothesis HG4 : ∀x0 ∈ int, ∀x1 ∈ int, G4 x0 x1 ∈ int
L61Variable H4 : set → set
L62Hypothesis HH4 : ∀x0 ∈ int, H4 x0 ∈ int
L63Variable F5 : set → set
L64Hypothesis HF5 : ∀x0 ∈ int, F5 x0 ∈ int
L65Variable G5 : set → set
L66Hypothesis HG5 : ∀x0 ∈ int, G5 x0 ∈ int
L68Hypothesis HH5 : H5 ∈ int
L69Variable U5 : set → set → set
L70Hypothesis HU5 : ∀x0 ∈ int, ∀x1 ∈ int, U5 x0 x1 ∈ int
L71Variable V5 : set → set
L72Hypothesis HV5 : ∀x0 ∈ int, V5 x0 ∈ int
L73Variable I4 : set → set
L74Hypothesis HI4 : ∀x0 ∈ int, I4 x0 ∈ int
L76Hypothesis HJ4 : J4 ∈ int
L77Variable U4 : set → set → set → set
L78Hypothesis HU4 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U4 x0 x1 x2 ∈ int
L79Variable V4 : set → set → set → set
L80Hypothesis HV4 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V4 x0 x1 x2 ∈ int
L81Variable W4 : set → set
L82Hypothesis HW4 : ∀x0 ∈ int, W4 x0 ∈ int
L83Variable FAST : set → set
L84Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L85Hypothesis H1 : (∀X ∈ int, ((F0 X) = ((X + X) + X)))
L86Hypothesis H2 : (∀X ∈ int, ((G0 X) = X))
L87Hypothesis H3 : (∀X ∈ int, ((F1 X) = (X + X)))
L88Hypothesis H4 : (∀X ∈ int, ((G1 X) = X))
L89Hypothesis H5 : (H1 = 1)
L90Hypothesis H6 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y))))))
L91Hypothesis H7 : (∀X ∈ int, ((V1 X) = (U1 (G1 X) H1)))
L92Hypothesis H8 : (∀X ∈ int, ((H0 X) = (1 + (V1 X))))
L93Hypothesis H9 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y))))))
L94Hypothesis H10 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) (H0 X))))
L95Hypothesis H11 : (∀X ∈ int, ((F2 X) = ((2 * (X + X)) + X)))
L96Hypothesis H12 : (∀X ∈ int, ((G2 X) = X))
L97Hypothesis H13 : (H2 = 1)
L98Hypothesis H14 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y))))))
L99Hypothesis H15 : (∀X ∈ int, ((V2 X) = (U2 (G2 X) H2)))
L100Hypothesis H16 : (∀X ∈ int, ((SMALL X) = ((V0 X) + (V2 X))))
L101Hypothesis H17 : (∀X ∈ int, (∀Y ∈ int, ((F3 X Y) = (X * Y))))
L102Hypothesis H18 : (∀X ∈ int, (∀Y ∈ int, ((G3 X Y) = Y)))
L103Hypothesis H19 : (∀X ∈ int, ((H3 X) = X))
L104Hypothesis H20 : (I3 = 1)
L105Hypothesis H21 : (J3 = (1 + (2 + 2)))
L106Hypothesis H22 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((U3 X Y Z) = (if (X <= 0) then Y else (F3 (U3 (X + - 1) Y Z) (V3 (X + - 1) Y Z)))))))
L107Hypothesis H23 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((V3 X Y Z) = (if (X <= 0) then Z else (G3 (U3 (X + - 1) Y Z) (V3 (X + - 1) Y Z)))))))
L108Hypothesis H24 : (∀X ∈ int, ((W3 X) = (U3 (H3 X) I3 J3)))
L109Hypothesis H25 : (∀X ∈ int, (∀Y ∈ int, ((F4 X Y) = (X * Y))))
L110Hypothesis H26 : (∀X ∈ int, (∀Y ∈ int, ((G4 X Y) = Y)))
L111Hypothesis H27 : (∀X ∈ int, ((H4 X) = X))
L112Hypothesis H28 : (∀X ∈ int, ((F5 X) = (X + X)))
L113Hypothesis H29 : (∀X ∈ int, ((G5 X) = X))
L114Hypothesis H30 : (H5 = 1)
L115Hypothesis H31 : (∀X ∈ int, (∀Y ∈ int, ((U5 X Y) = (if (X <= 0) then Y else (F5 (U5 (X + - 1) Y))))))
L116Hypothesis H32 : (∀X ∈ int, ((V5 X) = (U5 (G5 X) H5)))
L117Hypothesis H33 : (∀X ∈ int, ((I4 X) = (1 + (V5 X))))
L118Hypothesis H34 : (J4 = (1 + 2))
L119Hypothesis H35 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((U4 X Y Z) = (if (X <= 0) then Y else (F4 (U4 (X + - 1) Y Z) (V4 (X + - 1) Y Z)))))))
L120Hypothesis H36 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((V4 X Y Z) = (if (X <= 0) then Z else (G4 (U4 (X + - 1) Y Z) (V4 (X + - 1) Y Z)))))))
L121Hypothesis H37 : (∀X ∈ int, ((W4 X) = (U4 (H4 X) (I4 X) J4)))
L122Hypothesis H38 : (∀X ∈ int, ((FAST X) = ((W3 X) + (W4 X))))
L123Theorem. (
A1579)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
Proof: Proof not loaded.