Beginning of Section A13832

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.

(*** $I sig/OEISPreamble.mgs ***)

(*** Bounty 1 PFG TMLyrXQUUeeq5v4CGU8uypGZmEzUsmXtA2j ***)

Variable F0 : set → set

L10

Hypothesis HF0 : ∀x0 ∈ int, F0 x0 ∈ int

L11

Variable G0 : set → set

L12

Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int

L13

Variable H0 : set

L14

Hypothesis HH0 : H0 ∈ int

L15

Variable U0 : set → set → set

L16

Hypothesis HU0 : ∀x0 ∈ int, ∀x1 ∈ int, U0 x0 x1 ∈ int

L17

Variable V0 : set → set

L18

Hypothesis HV0 : ∀x0 ∈ int, V0 x0 ∈ int

L19

Variable SMALL : set → set

L20

Hypothesis HSMALL : ∀x0 ∈ int, SMALL x0 ∈ int

L21

Variable F1 : set → set

L22

Hypothesis HF1 : ∀x0 ∈ int, F1 x0 ∈ int

L23

Variable G1 : set

L24

Hypothesis HG1 : G1 ∈ int

L25

Variable F2 : set → set

L26

Hypothesis HF2 : ∀x0 ∈ int, F2 x0 ∈ int

L27

Variable G2 : set

L28

Hypothesis HG2 : G2 ∈ int

L29

Variable F3 : set → set

L30

Hypothesis HF3 : ∀x0 ∈ int, F3 x0 ∈ int

L31

Variable G3 : set → set

L32

Hypothesis HG3 : ∀x0 ∈ int, G3 x0 ∈ int

L33

Variable H3 : set

L34

Hypothesis HH3 : H3 ∈ int

L35

Variable U3 : set → set → set

L36

Hypothesis HU3 : ∀x0 ∈ int, ∀x1 ∈ int, U3 x0 x1 ∈ int

L37

Variable V3 : set → set

L38

Hypothesis HV3 : ∀x0 ∈ int, V3 x0 ∈ int

L39

Variable H2 : set → set

L40

Hypothesis HH2 : ∀x0 ∈ int, H2 x0 ∈ int

L41

Variable U2 : set → set → set

L42

Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int

L43

Variable V2 : set → set

L44

Hypothesis HV2 : ∀x0 ∈ int, V2 x0 ∈ int

L45

Variable H1 : set → set

L46

Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int

L47

Variable U1 : set → set → set

L48

Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int

L49

Variable V1 : set → set

L50

Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int

L51

Variable F4 : set → set

L52

Hypothesis HF4 : ∀x0 ∈ int, F4 x0 ∈ int

L53

Variable G4 : set

L54

Hypothesis HG4 : G4 ∈ int

L55

Variable F5 : set → set

L56

Hypothesis HF5 : ∀x0 ∈ int, F5 x0 ∈ int

L57

Variable G5 : set

L58

Hypothesis HG5 : G5 ∈ int

L59

Variable F6 : set → set

L60

Hypothesis HF6 : ∀x0 ∈ int, F6 x0 ∈ int

L61

Variable G6 : set → set

L62

Hypothesis HG6 : ∀x0 ∈ int, G6 x0 ∈ int

L63

Variable H6 : set

L64

Hypothesis HH6 : H6 ∈ int

L65

Variable U6 : set → set → set

L66

Hypothesis HU6 : ∀x0 ∈ int, ∀x1 ∈ int, U6 x0 x1 ∈ int

L67

Variable V6 : set → set

L68

Hypothesis HV6 : ∀x0 ∈ int, V6 x0 ∈ int

L69

Variable H5 : set → set

L70

Hypothesis HH5 : ∀x0 ∈ int, H5 x0 ∈ int

L71

Variable U5 : set → set → set

L72

Hypothesis HU5 : ∀x0 ∈ int, ∀x1 ∈ int, U5 x0 x1 ∈ int

L73

Variable V5 : set → set

L74

Hypothesis HV5 : ∀x0 ∈ int, V5 x0 ∈ int

L75

Variable H4 : set → set

L76

Hypothesis HH4 : ∀x0 ∈ int, H4 x0 ∈ int

L77

Variable U4 : set → set → set

L78

Hypothesis HU4 : ∀x0 ∈ int, ∀x1 ∈ int, U4 x0 x1 ∈ int

L79

Variable V4 : set → set

L80

Hypothesis HV4 : ∀x0 ∈ int, V4 x0 ∈ int

L81

Variable FAST : set → set

L82

Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int

L83

Hypothesis H1 : (∀X ∈ int, ((F0 X) = (X + X)))

L84

Hypothesis H2 : (∀X ∈ int, ((G0 X) = ((1 + (2 + 2)) * (1 + (X + X)))))

L85

Hypothesis H3 : (H0 = 2)

L86

Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y))))))

L87

Hypothesis H5 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) H0)))

L88

Hypothesis H6 : (∀X ∈ int, ((SMALL X) = (V0 X)))

L89

Hypothesis H7 : (∀X ∈ int, ((F1 X) = ((X * X) * X)))

L90

Hypothesis H8 : (G1 = 1)

L91

Hypothesis H9 : (∀X ∈ int, ((F2 X) = (X * X)))

L92

Hypothesis H10 : (G2 = 1)

L93

Hypothesis H11 : (∀X ∈ int, ((F3 X) = (X + X)))

L94

Hypothesis H12 : (∀X ∈ int, ((G3 X) = X))

L95

Hypothesis H13 : (H3 = 1)

L96

Hypothesis H14 : (∀X ∈ int, (∀Y ∈ int, ((U3 X Y) = (if (X <= 0) then Y else (F3 (U3 (X + - 1) Y))))))

L97

Hypothesis H15 : (∀X ∈ int, ((V3 X) = (U3 (G3 X) H3)))

L98

Hypothesis H16 : (∀X ∈ int, ((H2 X) = (V3 X)))

L99

Hypothesis H17 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y))))))

L100

Hypothesis H18 : (∀X ∈ int, ((V2 X) = (U2 G2 (H2 X))))

L101

Hypothesis H19 : (∀X ∈ int, ((H1 X) = (V2 X)))

L102

Hypothesis H20 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y))))))

L103

Hypothesis H21 : (∀X ∈ int, ((V1 X) = (U1 G1 (H1 X))))

L104

Hypothesis H22 : (∀X ∈ int, ((F4 X) = (X * X)))

L105

Hypothesis H23 : (G4 = 1)

L106

Hypothesis H24 : (∀X ∈ int, ((F5 X) = ((X * 2) * X)))

L107

Hypothesis H25 : (G5 = 1)

L108

Hypothesis H26 : (∀X ∈ int, ((F6 X) = (X + X)))

L109

Hypothesis H27 : (∀X ∈ int, ((G6 X) = X))

L110

Hypothesis H28 : (H6 = 2)

L111

Hypothesis H29 : (∀X ∈ int, (∀Y ∈ int, ((U6 X Y) = (if (X <= 0) then Y else (F6 (U6 (X + - 1) Y))))))

L112

Hypothesis H30 : (∀X ∈ int, ((V6 X) = (U6 (G6 X) H6)))

L113

Hypothesis H31 : (∀X ∈ int, ((H5 X) = (V6 X)))

L114

Hypothesis H32 : (∀X ∈ int, (∀Y ∈ int, ((U5 X Y) = (if (X <= 0) then Y else (F5 (U5 (X + - 1) Y))))))

L115

Hypothesis H33 : (∀X ∈ int, ((V5 X) = (U5 G5 (H5 X))))

L116

Hypothesis H34 : (∀X ∈ int, ((H4 X) = (V5 X)))

L117

Hypothesis H35 : (∀X ∈ int, (∀Y ∈ int, ((U4 X Y) = (if (X <= 0) then Y else (F4 (U4 (X + - 1) Y))))))

L118

Hypothesis H36 : (∀X ∈ int, ((V4 X) = (U4 G4 (H4 X))))

L119

Hypothesis H37 : (∀X ∈ int, ((FAST X) = ((V1 X) * (V4 X))))

L120

Theorem. (A13832)

(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))

In Proofgold the corresponding term root is 55f70c... and proposition id is d732b7...

Proof:
Proof not loaded.