Checks if a binary, square matrix is in partial order

main.py

# Henceforth arr
a = [
    [1,1,1,1],
    [1,1,1,1],
    [1,1,1,1],
    [1,1,1,1]
]

def find_ones(arr):
    b = []
    for i, x in enumerate(arr):
        for j,y in enumerate(x):
            if y == 1:
                b.append((i,j))
    return b

b = find_ones(a)

def check_reflexivity(arr):
    l = len(arr)
    for x in range(l):
        if arr[x][x] != 1:
            print(f"Not reflexive ({x+1}, {x+1})")
            return False

        
def check_anti_symmetry(ordered):
    for x,y in ordered:
        try:
            ordered.index((y,x))
        except ValueError:
            continue
        if x != y:
            print(f"Not anti-symmetric: ({x+1},{y+1}): the elements are not the same")
            return False

def check_transitivity(arr, ordered):
    """:param ordered: the ordered pairs that were 1"""
    for x in ordered:
        for y in ordered:
            if arr[x[0]][y[1]] != 1:
                print(f"Not transitive: ({x[0] + 1},{x[1] + 1}) ({y[0] + 1},{y[1] + 1})")
                return False
    return True

def check(arr, ordered):
    check_reflexivity(arr)
    check_anti_symmetry(ordered)
    check_transitivity(arr, ordered)

check(a, b)

lmao it's antisymmetric, not asymmetric

sooo lazy.... didn't even use np...