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