QLE Home Quantum Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  ml3 Unicode version
Theorem ml3 1128
Description: Form of modular law that swaps two terms.
Assertion
Ref Expression
ml3 (a v (b ^ (c v a))) = (a v (c ^ (b v a)))
Proof of Theorem ml3
StepHypRef Expression
1 ml3le 1127 . 2 (a v (b ^ (c v a))) =< (a v (c ^ (b v a)))
2 ml3le 1127 . 2 (a v (c ^ (b v a))) =< (a v (b ^ (c v a)))
31, 2lebi 145 1 (a v (b ^ (c v a))) = (a v (c ^ (b v a)))
Colors of variables: term
Syntax hints:   = wb 1   v wo 6   ^ wa 7
This theorem was proved from axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-ml 1120
This theorem depends on definitions:  df-a 40  df-t 41  df-f 42  df-le1 130  df-le2 131
This theorem is referenced by:  dp41lemg  1187  dp41lemj  1189  xdp41  1196  xxdp41  1199  xdp45lem  1202  xdp43lem  1203  xdp45  1204  xdp43  1205  3dp43  1206
  Copyright terms: Public domain W3C validator