[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ledior 169
Description: Half of distributive law.
Assertion
Ref Expression
ledior ((b ^ c) v a) =< ((b v a) ^ (c v a))

Proof of Theorem ledior
StepHypRef Expression
1 ledio 168 . 2 (a v (b ^ c)) =< ((a v b) ^ (a v c))
2 ax-a2 30 . 2 ((b ^ c) v a) = (a v (b ^ c))
3 ax-a2 30 . . 3 (b v a) = (a v b)
4 ax-a2 30 . . 3 (c v a) = (a v c)
53, 42an 72 . 2 ((b v a) ^ (c v a)) = ((a v b) ^ (a v c))
61, 2, 5le3tr1 132 1 ((b ^ c) v a) =< ((b v a) ^ (c v a))
Colors of variables: term
Syntax hints:   =< wle 2   v wo 6   ^ wa 7
This theorem is referenced by:  oadistc0 1001
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123
metamath.org