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

Theorem anandi 106
Description: Distribution of conjunction over conjunction.
Assertion
Ref Expression
anandi (a ^ (b ^ c)) = ((a ^ b) ^ (a ^ c))

Proof of Theorem anandi
StepHypRef Expression
1 anidm 103 . . . 4 (a ^ a) = a
21ax-r1 34 . . 3 a = (a ^ a)
32ran 71 . 2 (a ^ (b ^ c)) = ((a ^ a) ^ (b ^ c))
4 an4 78 . 2 ((a ^ a) ^ (b ^ c)) = ((a ^ b) ^ (a ^ c))
53, 4ax-r2 35 1 (a ^ (b ^ c)) = ((a ^ b) ^ (a ^ c))
Colors of variables: term
Syntax hints:   = wb 1   ^ wa 7
This theorem is referenced by:  wwfh1 208  wdf-c2 366  wfh1 405  fh1 451  i3bi 478  u5lembi 707  u3lem13b 772  3vth9 794  mlaoml 815  comanblem1 852
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-a 39  df-t 40  df-f 41
metamath.org