Beginning of Section A10052
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 TMUM3UCbXY2ZkbDN1fcMzPm7odusjVvfyFS ***)
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 F2 : set → set
L24
Hypothesis HF2 : ∀x0 ∈ int, F2 x0 ∈ int
L25
Variable G2 : set
L26
Hypothesis HG2 : G2 ∈ int
L27
Variable H2 : set
L28
Hypothesis HH2 : H2 ∈ int
L29
Variable U2 : set → set → set
L30
Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int
L31
Variable V2 : set
L32
Hypothesis HV2 : V2 ∈ int
L33
Variable G1 : set
L34
Hypothesis HG1 : G1 ∈ int
L35
Variable H1 : set → set
L36
Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int
L37
Variable U1 : set → set → set
L38
Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L39
Variable V1 : set → set
L40
Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int
L41
Variable FAST : set → set
L42
Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L43
Hypothesis H1 : (∀X ∈ int, (∀Y ∈ int, ((F0 X Y) = ((if (X <= 0) then 0 else Y) + - X))))
L44
Hypothesis H2 : (∀X ∈ int, ((G0 X) = X))
L45
Hypothesis H3 : (∀X ∈ int, ((H0 X) = X))
L46
Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y) X)))))
L47
Hypothesis H5 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) (H0 X))))
L48
Hypothesis H6 : (∀X ∈ int, ((SMALL X) = (if ((V0 X) <= 0) then 1 else 0)))
L49
Hypothesis H7 : (∀X ∈ int, (∀Y ∈ int, ((F1 X Y) = ((if ((Y + - X) <= 0) then Y else 0) + - X))))
L50
Hypothesis H8 : (∀X ∈ int, ((F2 X) = (X * X)))
L51
Hypothesis H9 : (G2 = 1)
L52
Hypothesis H10 : (H2 = (2 + 2))
L53
Hypothesis H11 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y))))))
L54
Hypothesis H12 : (V2 = (U2 G2 H2))
L55
Hypothesis H13 : (G1 = (2 + V2))
L56
Hypothesis H14 : (∀X ∈ int, ((H1 X) = X))
L57
Hypothesis H15 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y) X)))))
L58
Hypothesis H16 : (∀X ∈ int, ((V1 X) = (U1 G1 (H1 X))))
L59
Hypothesis H17 : (∀X ∈ int, ((FAST X) = (if ((V1 X) <= 0) then 1 else 0)))
L60
Theorem. (A10052)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
In Proofgold the corresponding term root is 8315ce... and proposition id is fca261...
Proof:
Proof not loaded.
End of Section A10052