Beginning of Section A16226
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 TMRQZCRBBpRC3JFuxhLqtCKeFz5NyvUZmMh ***)
L9
Variable F1 : set → set
L10
Hypothesis HF1 : ∀x0 ∈ int, F1 x0 ∈ int
L11
Variable G1 : set → set → set
L12
Hypothesis HG1 : ∀x0 ∈ int, ∀x1 ∈ int, G1 x0 x1 ∈ int
L13
Variable H1 : set
L14
Hypothesis HH1 : H1 ∈ int
L15
Variable U1 : set → set → set
L16
Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L17
Variable V1 : set → set → set
L18
Hypothesis HV1 : ∀x0 ∈ int, ∀x1 ∈ int, V1 x0 x1 ∈ int
L19
Variable F2 : set → set → set
L20
Hypothesis HF2 : ∀x0 ∈ int, ∀x1 ∈ int, F2 x0 x1 ∈ int
L21
Variable G2 : set
L22
Hypothesis HG2 : G2 ∈ int
L23
Variable H2 : set → set
L24
Hypothesis HH2 : ∀x0 ∈ int, H2 x0 ∈ int
L25
Variable U2 : set → set → set
L26
Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int
L27
Variable V2 : set → set
L28
Hypothesis HV2 : ∀x0 ∈ int, V2 x0 ∈ int
L29
Variable F0 : set → set → set
L30
Hypothesis HF0 : ∀x0 ∈ int, ∀x1 ∈ int, F0 x0 x1 ∈ int
L31
Variable G0 : set → set
L32
Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L33
Variable H0 : set
L34
Hypothesis HH0 : H0 ∈ int
L35
Variable U0 : set → set → set
L36
Hypothesis HU0 : ∀x0 ∈ int, ∀x1 ∈ int, U0 x0 x1 ∈ int
L37
Variable V0 : set → set
L38
Hypothesis HV0 : ∀x0 ∈ int, V0 x0 ∈ int
L39
Variable SMALL : set → set
L40
Hypothesis HSMALL : ∀x0 ∈ int, SMALL x0 ∈ int
L41
Variable F3 : set → set → set
L42
Hypothesis HF3 : ∀x0 ∈ int, ∀x1 ∈ int, F3 x0 x1 ∈ int
L43
Variable G3 : set → set → set
L44
Hypothesis HG3 : ∀x0 ∈ int, ∀x1 ∈ int, G3 x0 x1 ∈ int
L45
Variable H3 : set → set
L46
Hypothesis HH3 : ∀x0 ∈ int, H3 x0 ∈ int
L47
Variable I3 : set
L48
Hypothesis HI3 : I3 ∈ int
L49
Variable J3 : set
L50
Hypothesis HJ3 : J3 ∈ int
L51
Variable U3 : set → set → set → set
L52
Hypothesis HU3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, U3 x0 x1 x2 ∈ int
L53
Variable V3 : set → set → set → set
L54
Hypothesis HV3 : ∀x0 ∈ int, ∀x1 ∈ int, ∀x2 ∈ int, V3 x0 x1 x2 ∈ int
L55
Variable W3 : set → set
L56
Hypothesis HW3 : ∀x0 ∈ int, W3 x0 ∈ int
L57
Variable FAST : set → set
L58
Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L59
Hypothesis H1 : (∀X ∈ int, ((F1 X) = (1 + (2 * (X + X)))))
L60
Hypothesis H2 : (∀X ∈ int, (∀Y ∈ int, ((G1 X Y) = Y)))
L61
Hypothesis H3 : (H1 = 1)
L62
Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y))))))
L63
Hypothesis H5 : (∀X ∈ int, (∀Y ∈ int, ((V1 X Y) = (U1 (G1 X Y) H1))))
L64
Hypothesis H6 : (∀X ∈ int, (∀Y ∈ int, ((F2 X Y) = ((2 + Y) * X))))
L65
Hypothesis H7 : (G2 = 2)
L66
Hypothesis H8 : (∀X ∈ int, ((H2 X) = X))
L67
Hypothesis H9 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y) X)))))
L68
Hypothesis H10 : (∀X ∈ int, ((V2 X) = (U2 G2 (H2 X))))
L69
Hypothesis H11 : (∀X ∈ int, (∀Y ∈ int, ((F0 X Y) = (((V1 X Y) + - X) + (V2 X)))))
L70
Hypothesis H12 : (∀X ∈ int, ((G0 X) = X))
L71
Hypothesis H13 : (H0 = 1)
L72
Hypothesis H14 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y) X)))))
L73
Hypothesis H15 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) H0)))
L74
Hypothesis H16 : (∀X ∈ int, ((SMALL X) = (V0 X)))
L75
Hypothesis H17 : (∀X ∈ int, (∀Y ∈ int, ((F3 X Y) = (((2 * ((2 * (X + X)) + X)) + X) + Y))))
L76
Hypothesis H18 : (∀X ∈ int, (∀Y ∈ int, ((G3 X Y) = (1 + (2 * (Y + Y))))))
L77
Hypothesis H19 : (∀X ∈ int, ((H3 X) = X))
L78
Hypothesis H20 : (I3 = 1)
L79
Hypothesis H21 : (J3 = (1 + (2 + 2)))
L80
Hypothesis 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)))))))
L81
Hypothesis 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)))))))
L82
Hypothesis H24 : (∀X ∈ int, ((W3 X) = (U3 (H3 X) I3 J3)))
L83
Hypothesis H25 : (∀X ∈ int, ((FAST X) = (W3 X)))
L84
Theorem. (A16226)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
In Proofgold the corresponding term root is 50bbd5... and proposition id is 5b0e37...
Proof:
Proof not loaded.
End of Section A16226