Proof of X≤Y inverse to X˃Y

[Gamo]

HP-12C only got two conditional test of [X≤Y] and [X=0]

Recently I try to do the inverse of the [X≤Y] to [X˃Y]

To get [X˃Y] this must use [X≤Y] three times.

Here is the simple program to make this proof.

Case 1. [X≤Y] If true result show 101 If false result show 1
Case 2. [X˃Y] If true result show 101 If false result show 1

101 for True
1 for False

Procedure:
Y [ENTER] X [R/S] ---> Case 1
Y [ENTER] X [R/S] ---> Case 2

Example:
Y stack is 100 and X stack is 100

100 [ENTER] 100 [R/S] display 101 // [X≤Y] 100 ≤ 100 that is TRUE
100 [ENTER] 100 [R/S] display 1 // [X˃Y] 100 ˃ 100 that is FALSE

Y stack is 100 and X stack is 101

100 [ENTER] 101 [R/S] display 1 // [X≤Y] 101 ≤ 100 that is FALSE
100 [ENTER] 101 [R/S] display 101 //[X˃Y] 101 ˃ 100 that is TRUE


Program: Conditional Test comparison between [X≤Y] and [X˃Y]

Code:


01 X≤Y ?
02 GTO 05   // True
03  1    // False
04 GTO 08
05  1
06  0
07  1
08 R/S
09 X≤Y ?    // Line 9 to 11 test become X˃Y ?
10 X≤Y ?
11 X≤Y ?
12 GTO 17    // False
13  1    // True
14  0
15  1
16 GTO 00
17  1
18 GTO 00

This is just a curiosity. Is this really work as show in these example?

Gamo