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

Theorem omln 428
Description: Orthomodular law.
Assertion
Ref Expression
omln (a_|_ v (a ^ (a_|_ v b))) = (a_|_ v b)

Proof of Theorem omln
StepHypRef Expression
1 ax-a1 29 . . . 4 a = a_|__|_
21ran 71 . . 3 (a ^ (a_|_ v b)) = (a_|__|_ ^ (a_|_ v b))
32lor 66 . 2 (a_|_ v (a ^ (a_|_ v b))) = (a_|_ v (a_|__|_ ^ (a_|_ v b)))
4 oml 427 . 2 (a_|_ v (a_|__|_ ^ (a_|_ v b))) = (a_|_ v b)
53, 4ax-r2 35 1 (a_|_ v (a ^ (a_|_ v b))) = (a_|_ v b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7
This theorem is referenced by:  omla 429  i3lem4 489  lem4 493  i3abs1 504  u3lemona 609  kb10iii 875
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  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41
metamath.org