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

Theorem str 181
Description: Strengthening rule.
Hypotheses
Ref Expression
str.1 a =< (b v c)
str.2 (a ^ (b v c)) =< b
Assertion
Ref Expression
str a =< b

Proof of Theorem str
StepHypRef Expression
1 id 58 . . . 4 a = a
21bile 134 . . 3 a =< a
3 str.1 . . 3 a =< (b v c)
42, 3ler2an 165 . 2 a =< (a ^ (b v c))
5 str.2 . 2 (a ^ (b v c)) =< b
64, 5letr 129 1 a =< b
Colors of variables: term
Syntax hints:   =< wle 2   v wo 6   ^ wa 7
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