Let ( L, ≤ ) be a lattice, x, y, z ∈ L
I am unable to understand why ( x ∧ z ) ∧ ( y ∧ z ) = z ∧ ( y ∧ x ) is mentioned as fact in Y.N. Singh's "Mathematical Foundation of Computer Science" - Pg 157
Could I prove this somehow, or is it an axiom?
Let ( L, ≤ ) be a lattice, x, y, z ∈ L
I am unable to understand why ( x ∧ z ) ∧ ( y ∧ z ) = z ∧ ( y ∧ x ) is mentioned as fact in Y.N. Singh's "Mathematical Foundation of Computer Science" - Pg 157
Could I prove this somehow, or is it an axiom?