QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  wddi-4 Unicode version
Theorem wddi-4 1119
Description: The weak distributive law in WDOL.
Assertion
Ref Expression
wddi-4 ((a ^ (b v c)) ==4 ((a ^ b) v (a ^ c))) = 1
Proof of Theorem wddi-4
StepHypRef Expression
1 wddi-0 1115 . 2 ((a ^ (b v c)) ==0 ((a ^ b) v (a ^ c))) = 1
21wdid0id4 1113 1 ((a ^ (b v c)) ==4 ((a ^ b) v (a ^ c))) = 1
Colors of variables: term
Syntax hints:   = wb 1   v wo 6   ^ wa 7  1wt 8   ==4 wid4 21
This theorem was proved from axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-wom 361  ax-wdol 1102
This theorem depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i2 45  df-id0 49  df-id4 53  df-le 129  df-le1 130  df-le2 131  df-cmtr 134
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator