Beginning of Section A6625
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 TMbQ5C8QXXFoLEFWGtBus4qBcs7if6t4KNf ***)
L9
Variable F0 : set → set → set
L10
Hypothesis HF0 : ∀x0 ∈ int, ∀x1 ∈ int, F0 x0 x1 ∈ int
L11
Variable G0 : set → set
L12
Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L13
Variable H0 : set → set
L14
Hypothesis HH0 : ∀x0 ∈ int, H0 x0 ∈ 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 → set
L22
Hypothesis HF1 : ∀x0 ∈ int, ∀x1 ∈ int, F1 x0 x1 ∈ int
L23
Variable G1 : set → set
L24
Hypothesis HG1 : ∀x0 ∈ int, G1 x0 ∈ int
L25
Variable H1 : set → set
L26
Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int
L27
Variable U1 : set → set → set
L28
Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L29
Variable V1 : set → set
L30
Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int
L31
Variable FAST : set → set
L32
Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L33
Hypothesis H1 : (∀X ∈ int, (∀Y ∈ int, ((F0 X Y) = (1 + (X + Y)))))
L34
Hypothesis H2 : (∀X ∈ int, ((G0 X) = ((2 + X) + 2)))
L35
Hypothesis H3 : (∀X ∈ int, ((H0 X) = (if (X <= 0) then 0 else 1)))
L36
Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y) X)))))
L37
Hypothesis H5 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) (H0 X))))
L38
Hypothesis H6 : (∀X ∈ int, ((SMALL X) = (V0 X)))
L39
Hypothesis H7 : (∀X ∈ int, (∀Y ∈ int, ((F1 X Y) = (X + Y))))
L40
Hypothesis H8 : (∀X ∈ int, ((G1 X) = (X + - 2)))
L41
Hypothesis H9 : (∀X ∈ int, ((H1 X) = ((2 + X) * (1 + (2 + (2 + 2))))))
L42
Hypothesis H10 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y) X)))))
L43
Hypothesis H11 : (∀X ∈ int, ((V1 X) = (U1 (G1 X) (H1 X))))
L44
Hypothesis H12 : (∀X ∈ int, ((FAST X) = (V1 X)))
L45
Theorem. (A6625)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
In Proofgold the corresponding term root is 3b14d6... and proposition id is 6bc1c1...
Proof:
Proof not loaded.
End of Section A6625