Beginning of Section A158609
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 F2 : set → set
L12Hypothesis HF2 : ∀x0 ∈ int, F2 x0 ∈ int
L14Hypothesis HG2 : G2 ∈ int
L15Variable H2 : set → set
L16Hypothesis HH2 : ∀x0 ∈ int, H2 x0 ∈ int
L17Variable U2 : set → set → set
L18Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int
L19Variable V2 : set → set
L20Hypothesis HV2 : ∀x0 ∈ int, V2 x0 ∈ int
L21Variable F1 : set → set
L22Hypothesis HF1 : ∀x0 ∈ int, F1 x0 ∈ int
L24Hypothesis HG1 : G1 ∈ int
L25Variable H1 : set → set
L26Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int
L27Variable U1 : set → set → set
L28Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L29Variable V1 : set → set
L30Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int
L31Variable G0 : set → set
L32Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L33Variable H0 : set → set
L34Hypothesis HH0 : ∀x0 ∈ int, H0 x0 ∈ int
L36Hypothesis HI0 : I0 ∈ int
L38Hypothesis HJ0 : J0 ∈ int
L39Variable U0 : set → set → set → set
L40Hypothesis HU0 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U0 x0 x1 x2 ∈ int
L41Variable V0 : set → set → set → set
L42Hypothesis HV0 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V0 x0 x1 x2 ∈ int
L43Variable W0 : set → set
L44Hypothesis HW0 : ∀x0 ∈ int, W0 x0 ∈ int
L45Variable SMALL : set → set
L46Hypothesis HSMALL : ∀x0 ∈ int, SMALL x0 ∈ int
L47Variable F3 : set → set → set
L48Hypothesis HF3 : ∀x0 ∈ int, ∀x1 ∈ int, F3 x0 x1 ∈ int
L49Variable F4 : set → set
L50Hypothesis HF4 : ∀x0 ∈ int, F4 x0 ∈ int
L52Hypothesis HG4 : G4 ∈ int
L53Variable H4 : set → set
L54Hypothesis HH4 : ∀x0 ∈ int, H4 x0 ∈ int
L55Variable U4 : set → set → set
L56Hypothesis HU4 : ∀x0 ∈ int, ∀x1 ∈ int, U4 x0 x1 ∈ int
L57Variable V4 : set → set
L58Hypothesis HV4 : ∀x0 ∈ int, V4 x0 ∈ int
L59Variable G3 : set → set → set
L60Hypothesis HG3 : ∀x0 ∈ int, ∀x1 ∈ int, G3 x0 x1 ∈ int
L61Variable H3 : set → set
L62Hypothesis HH3 : ∀x0 ∈ int, H3 x0 ∈ int
L64Hypothesis HI3 : I3 ∈ int
L66Hypothesis HJ3 : J3 ∈ int
L67Variable U3 : set → set → set → set
L68Hypothesis HU3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U3 x0 x1 x2 ∈ int
L69Variable V3 : set → set → set → set
L70Hypothesis HV3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V3 x0 x1 x2 ∈ int
L71Variable W3 : set → set
L72Hypothesis HW3 : ∀x0 ∈ int, W3 x0 ∈ int
L73Variable FAST : set → set
L74Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L75Hypothesis H1 : (∀X ∈ int, (∀Y ∈ int, ((F0 X Y) = (X + Y))))
L76Hypothesis H2 : (∀X ∈ int, ((F2 X) = ((X + X) + X)))
L77Hypothesis H3 : (G2 = 2)
L78Hypothesis H4 : (∀X ∈ int, ((H2 X) = X))
L79Hypothesis H5 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y))))))
L80Hypothesis H6 : (∀X ∈ int, ((V2 X) = (U2 G2 (H2 X))))
L81Hypothesis H7 : (∀X ∈ int, ((F1 X) = (V2 X)))
L82Hypothesis H8 : (G1 = 2)
L83Hypothesis H9 : (∀X ∈ int, ((H1 X) = X))
L84Hypothesis H10 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y))))))
L85Hypothesis H11 : (∀X ∈ int, ((V1 X) = (U1 G1 (H1 X))))
L86Hypothesis H12 : (∀X ∈ int, ((G0 X) = (V1 X)))
L87Hypothesis H13 : (∀X ∈ int, ((H0 X) = X))
L88Hypothesis H14 : (I0 = 1)
L89Hypothesis H15 : (J0 = (2 * (2 + 2)))
L90Hypothesis H16 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((U0 X Y Z) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y Z) (V0 (X + - 1) Y Z)))))))
L91Hypothesis H17 : (∀X ∈ int, (∀Y ∈ int, (∀Z ∈ int, ((V0 X Y Z) = (if (X <= 0) then Z else (G0 (U0 (X + - 1) Y Z)))))))
L92Hypothesis H18 : (∀X ∈ int, ((W0 X) = (U0 (H0 X) I0 J0)))
L93Hypothesis H19 : (∀X ∈ int, ((SMALL X) = (W0 X)))
L94Hypothesis H20 : (∀X ∈ int, (∀Y ∈ int, ((F3 X Y) = ((2 * (2 * (Y + Y))) + Y))))
L95Hypothesis H21 : (∀X ∈ int, ((F4 X) = ((X + X) + X)))
L96Hypothesis H22 : (G4 = 2)
L97Hypothesis H23 : (∀X ∈ int, ((H4 X) = X))
L98Hypothesis H24 : (∀X ∈ int, (∀Y ∈ int, ((U4 X Y) = (if (X <= 0) then Y else (F4 (U4 (X + - 1) Y))))))
L99Hypothesis H25 : (∀X ∈ int, ((V4 X) = (U4 G4 (H4 X))))
L100Hypothesis H26 : (∀X ∈ int, (∀Y ∈ int, ((G3 X Y) = ((V4 X) + Y))))
L101Hypothesis H27 : (∀X ∈ int, ((H3 X) = X))
L102Hypothesis H28 : (I3 = 1)
L103Hypothesis H29 : (J3 = 1)
L104Hypothesis H30 : (∀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)))))))
L105Hypothesis H31 : (∀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)))))))
L106Hypothesis H32 : (∀X ∈ int, ((W3 X) = (U3 (H3 X) I3 J3)))
L107Hypothesis H33 : (∀X ∈ int, ((FAST X) = (W3 X)))
L108Theorem. (
A158609)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
Proof: Proof not loaded.