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

Theorem wler 373
Description: Add disjunct to right of l.e.
Hypothesis
Ref Expression
wle.1 (a =<2 b) = 1
Assertion
Ref Expression
wler (a =<2 (b v c)) = 1

Proof of Theorem wler
StepHypRef Expression
1 df-le 121 . 2 (a =<2 (b v c)) = ((a v (b v c)) == (b v c))
2 ax-a3 31 . . . . 5 ((a v b) v c) = (a v (b v c))
32ax-r1 34 . . . 4 (a v (b v c)) = ((a v b) v c)
43rbi 90 . . 3 ((a v (b v c)) == (b v c)) = (((a v b) v c) == (b v c))
5 df-le 121 . . . . . 6 (a =<2 b) = ((a v b) == b)
65ax-r1 34 . . . . 5 ((a v b) == b) = (a =<2 b)
7 wle.1 . . . . 5 (a =<2 b) = 1
86, 7ax-r2 35 . . . 4 ((a v b) == b) = 1
98wr5-2v 348 . . 3 (((a v b) v c) == (b v c)) = 1
104, 9ax-r2 35 . 2 ((a v (b v c)) == (b v c)) = 1
111, 10ax-r2 35 1 (a =<2 (b v c)) = 1
Colors of variables: term
Syntax hints:   = wb 1   == tb 5   v wo 6  1wt 9   =<2 wle2 11
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-wom 343
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le 121  df-le1 122  df-le2 123
metamath.org