Beginning of Section A193592
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 TMHrKo9zkHZqxJ6EVudtAtiwEuLRrzpya2b ***)
L9
Variable F2 : set → set → set
L10
Hypothesis HF2 : ∀x0 ∈ int, ∀x1 ∈ int, F2 x0 x1 ∈ int
L11
Variable G2 : set → set → set
L12
Hypothesis HG2 : ∀x0 ∈ int, ∀x1 ∈ int, G2 x0 x1 ∈ int
L13
Variable H2 : set → set
L14
Hypothesis HH2 : ∀x0 ∈ int, H2 x0 ∈ int
L15
Variable U2 : set → set → set
L16
Hypothesis HU2 : ∀x0 ∈ int, ∀x1 ∈ int, U2 x0 x1 ∈ int
L17
Variable V2 : set → set → set
L18
Hypothesis HV2 : ∀x0 ∈ int, ∀x1 ∈ int, V2 x0 x1 ∈ int
L19
Variable F1 : set → set → set
L20
Hypothesis HF1 : ∀x0 ∈ int, ∀x1 ∈ int, F1 x0 x1 ∈ int
L21
Variable G1 : set → set
L22
Hypothesis HG1 : ∀x0 ∈ int, G1 x0 ∈ int
L23
Variable H1 : set → set
L24
Hypothesis HH1 : ∀x0 ∈ int, H1 x0 ∈ int
L25
Variable U1 : set → set → set
L26
Hypothesis HU1 : ∀x0 ∈ int, ∀x1 ∈ int, U1 x0 x1 ∈ int
L27
Variable V1 : set → set
L28
Hypothesis HV1 : ∀x0 ∈ int, V1 x0 ∈ int
L29
Variable F0 : set → set
L30
Hypothesis HF0 : ∀x0 ∈ int, F0 x0 ∈ int
L31
Variable G0 : set → set
L32
Hypothesis HG0 : ∀x0 ∈ int, G0 x0 ∈ int
L33
Variable H0 : set → set
L34
Hypothesis HH0 : ∀x0 ∈ int, H0 x0 ∈ 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 F5 : set → set → set
L42
Hypothesis HF5 : ∀x0 ∈ int, ∀x1 ∈ int, F5 x0 x1 ∈ int
L43
Variable G5 : set → set → set
L44
Hypothesis HG5 : ∀x0 ∈ int, ∀x1 ∈ int, G5 x0 x1 ∈ int
L45
Variable H5 : set → set
L46
Hypothesis HH5 : ∀x0 ∈ int, H5 x0 ∈ int
L47
Variable U5 : set → set → set
L48
Hypothesis HU5 : ∀x0 ∈ int, ∀x1 ∈ int, U5 x0 x1 ∈ int
L49
Variable V5 : set → set → set
L50
Hypothesis HV5 : ∀x0 ∈ int, ∀x1 ∈ int, V5 x0 x1 ∈ int
L51
Variable F4 : set → set → set
L52
Hypothesis HF4 : ∀x0 ∈ int, ∀x1 ∈ int, F4 x0 x1 ∈ int
L53
Variable G4 : set → set
L54
Hypothesis HG4 : ∀x0 ∈ int, G4 x0 ∈ int
L55
Variable H4 : set → set
L56
Hypothesis HH4 : ∀x0 ∈ int, H4 x0 ∈ int
L57
Variable U4 : set → set → set
L58
Hypothesis HU4 : ∀x0 ∈ int, ∀x1 ∈ int, U4 x0 x1 ∈ int
L59
Variable V4 : set → set
L60
Hypothesis HV4 : ∀x0 ∈ int, V4 x0 ∈ int
L61
Variable F3 : set → set
L62
Hypothesis HF3 : ∀x0 ∈ int, F3 x0 ∈ int
L63
Variable F6 : set → set
L64
Hypothesis HF6 : ∀x0 ∈ int, F6 x0 ∈ int
L65
Variable G6 : set
L66
Hypothesis HG6 : G6 ∈ int
L67
Variable H6 : set
L68
Hypothesis HH6 : H6 ∈ int
L69
Variable U6 : set → set → set
L70
Hypothesis HU6 : ∀x0 ∈ int, ∀x1 ∈ int, U6 x0 x1 ∈ int
L71
Variable V6 : set
L72
Hypothesis HV6 : V6 ∈ int
L73
Variable G3 : set
L74
Hypothesis HG3 : G3 ∈ int
L75
Variable H3 : set → set
L76
Hypothesis HH3 : ∀x0 ∈ int, H3 x0 ∈ int
L77
Variable U3 : set → set → set
L78
Hypothesis HU3 : ∀x0 ∈ int, ∀x1 ∈ int, U3 x0 x1 ∈ int
L79
Variable V3 : set → set
L80
Hypothesis HV3 : ∀x0 ∈ int, V3 x0 ∈ int
L81
Variable FAST : set → set
L82
Hypothesis HFAST : ∀x0 ∈ int, FAST x0 ∈ int
L83
Hypothesis H1 : (∀X ∈ int, (∀Y ∈ int, ((F2 X Y) = (Y + - 1))))
L84
Hypothesis H2 : (∀X ∈ int, (∀Y ∈ int, ((G2 X Y) = (X + - Y))))
L85
Hypothesis H3 : (∀X ∈ int, ((H2 X) = X))
L86
Hypothesis H4 : (∀X ∈ int, (∀Y ∈ int, ((U2 X Y) = (if (X <= 0) then Y else (F2 (U2 (X + - 1) Y) X)))))
L87
Hypothesis H5 : (∀X ∈ int, (∀Y ∈ int, ((V2 X Y) = (U2 (G2 X Y) (H2 X)))))
L88
Hypothesis H6 : (∀X ∈ int, (∀Y ∈ int, ((F1 X Y) = (V2 X Y))))
L89
Hypothesis H7 : (∀X ∈ int, ((G1 X) = X))
L90
Hypothesis H8 : (∀X ∈ int, ((H1 X) = X))
L91
Hypothesis H9 : (∀X ∈ int, (∀Y ∈ int, ((U1 X Y) = (if (X <= 0) then Y else (F1 (U1 (X + - 1) Y) X)))))
L92
Hypothesis H10 : (∀X ∈ int, ((V1 X) = (U1 (G1 X) (H1 X))))
L93
Hypothesis H11 : (∀X ∈ int, ((F0 X) = ((if (((V1 X) + - 1) <= 0) then 0 else 1) + X)))
L94
Hypothesis H12 : (∀X ∈ int, ((G0 X) = X))
L95
Hypothesis H13 : (∀X ∈ int, ((H0 X) = X))
L96
Hypothesis H14 : (∀X ∈ int, (∀Y ∈ int, ((U0 X Y) = (if (X <= 0) then Y else (F0 (U0 (X + - 1) Y))))))
L97
Hypothesis H15 : (∀X ∈ int, ((V0 X) = (U0 (G0 X) (H0 X))))
L98
Hypothesis H16 : (∀X ∈ int, ((SMALL X) = (((V0 X) + - X) + 1)))
L99
Hypothesis H17 : (∀X ∈ int, (∀Y ∈ int, ((F5 X Y) = Y)))
L100
Hypothesis H18 : (∀X ∈ int, (∀Y ∈ int, ((G5 X Y) = (X + - Y))))
L101
Hypothesis H19 : (∀X ∈ int, ((H5 X) = X))
L102
Hypothesis H20 : (∀X ∈ int, (∀Y ∈ int, ((U5 X Y) = (if (X <= 0) then Y else (F5 (U5 (X + - 1) Y) X)))))
L103
Hypothesis H21 : (∀X ∈ int, (∀Y ∈ int, ((V5 X Y) = (U5 (G5 X Y) (H5 X)))))
L104
Hypothesis H22 : (∀X ∈ int, (∀Y ∈ int, ((F4 X Y) = (V5 X Y))))
L105
Hypothesis H23 : (∀X ∈ int, ((G4 X) = X))
L106
Hypothesis H24 : (∀X ∈ int, ((H4 X) = (2 + X)))
L107
Hypothesis H25 : (∀X ∈ int, (∀Y ∈ int, ((U4 X Y) = (if (X <= 0) then Y else (F4 (U4 (X + - 1) Y) X)))))
L108
Hypothesis H26 : (∀X ∈ int, ((V4 X) = (U4 (G4 X) (H4 X))))
L109
Hypothesis H27 : (∀X ∈ int, ((F3 X) = (((if (((V4 X) + - 2) <= 0) then 1 else 2) + - 1) + X)))
L110
Hypothesis H28 : (∀X ∈ int, ((F6 X) = (X * X)))
L111
Hypothesis H29 : (G6 = 2)
L112
Hypothesis H30 : (H6 = 2)
L113
Hypothesis H31 : (∀X ∈ int, (∀Y ∈ int, ((U6 X Y) = (if (X <= 0) then Y else (F6 (U6 (X + - 1) Y))))))
L114
Hypothesis H32 : (V6 = (U6 G6 H6))
L115
Hypothesis H33 : (G3 = V6)
L116
Hypothesis H34 : (∀X ∈ int, ((H3 X) = X))
L117
Hypothesis H35 : (∀X ∈ int, (∀Y ∈ int, ((U3 X Y) = (if (X <= 0) then Y else (F3 (U3 (X + - 1) Y))))))
L118
Hypothesis H36 : (∀X ∈ int, ((V3 X) = (U3 G3 (H3 X))))
L119
Hypothesis H37 : (∀X ∈ int, ((FAST X) = (((V3 X) + - X) + 1)))
L120
Theorem. (A193592)
(∀N ∈ int, ((0 <= N) → ((SMALL N) = (FAST N))))
Proof:
Proof not loaded.
End of Section A193592