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

Theorem comm1 171
Description: Commutation with 1. Kalmbach 83 p. 20.
Assertion
Ref Expression
comm1 1 C a

Proof of Theorem comm1
StepHypRef Expression
1 df-t 40 . . 3 1 = (a v a_|_)
2 ancom 68 . . . . . 6 (1 ^ a) = (a ^ 1)
3 an1 98 . . . . . 6 (a ^ 1) = a
42, 3ax-r2 35 . . . . 5 (1 ^ a) = a
5 ancom 68 . . . . . 6 (1 ^ a_|_) = (a_|_ ^ 1)
6 an1 98 . . . . . 6 (a_|_ ^ 1) = a_|_
75, 6ax-r2 35 . . . . 5 (1 ^ a_|_) = a_|_
84, 72or 67 . . . 4 ((1 ^ a) v (1 ^ a_|_)) = (a v a_|_)
98ax-r1 34 . . 3 (a v a_|_) = ((1 ^ a) v (1 ^ a_|_))
101, 9ax-r2 35 . 2 1 = ((1 ^ a) v (1 ^ a_|_))
1110df-c1 124 1 1 C a
Colors of variables: term
Syntax hints:   C wc 3  _|_wn 4   v wo 6   ^ wa 7  1wt 9
This theorem is referenced by:  wcom1 390
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  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  df-c1 124
metamath.org