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

Theorem wcomorr 394
Description: Weak commutation law.
Assertion
Ref Expression
wcomorr C (a, (a v b)) = 1

Proof of Theorem wcomorr
StepHypRef Expression
1 wleo 369 . 2 (a =<2 (a v b)) = 1
21wlecom 391 1 C (a, (a v b)) = 1
Colors of variables: term
Syntax hints:   = wb 1   v wo 6  1wt 9   C wcmtr 28
This theorem is referenced by:  wnbdi 411  ska2 414  ska4 415  woml6 418
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  df-cmtr 126
metamath.org