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

Theorem woml 203
Description: Theorem structurally similar to orthomodular law but does not require R3.
Assertion
Ref Expression
woml ((a v (a_|_ ^ (a v b))) == (a v b)) = 1

Proof of Theorem woml
StepHypRef Expression
1 omlem1 119 . 2 ((a v (a_|_ ^ (a v b))) v (a v b)) = (a v b)
2 omlem2 120 . 2 ((a v b)_|_ v (a v (a_|_ ^ (a v b)))) = 1
31, 2wlem3.1 202 1 ((a v (a_|_ ^ (a v b))) == (a v b)) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9
This theorem is referenced by:  wwoml2 204  ska11 231  wom4 362
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-b 38  df-a 39  df-t 40  df-f 41
metamath.org