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

Theorem cmtr1com 475
Description: Commutator equal to 1 commutes. Theorem 2.11 of Beran, p. 86.
Hypothesis
Ref Expression
cmtr1com.1 C (a, b) = 1
Assertion
Ref Expression
cmtr1com a C b

Proof of Theorem cmtr1com
StepHypRef Expression
1 lea 152 . . . . . 6 (a ^ b) =< a
2 lea 152 . . . . . 6 (a ^ b_|_) =< a
31, 2lel2or 162 . . . . 5 ((a ^ b) v (a ^ b_|_)) =< a
43df-le2 123 . . . 4 (((a ^ b) v (a ^ b_|_)) v a) = a
5 le1 138 . . . . 5 (a_|_ v ((a ^ b) v (a ^ b_|_))) =< 1
6 df-cmtr 126 . . . . . . 7 C (a, b) = (((a ^ b) v (a ^ b_|_)) v ((a_|_ ^ b) v (a_|_ ^ b_|_)))
7 cmtr1com.1 . . . . . . 7 C (a, b) = 1
8 ax-a2 30 . . . . . . 7 (((a ^ b) v (a ^ b_|_)) v ((a_|_ ^ b) v (a_|_ ^ b_|_))) = (((a_|_ ^ b) v (a_|_ ^ b_|_)) v ((a ^ b) v (a ^ b_|_)))
96, 7, 83tr2 61 . . . . . 6 1 = (((a_|_ ^ b) v (a_|_ ^ b_|_)) v ((a ^ b) v (a ^ b_|_)))
10 lea 152 . . . . . . . 8 (a_|_ ^ b) =< a_|_
11 lea 152 . . . . . . . 8 (a_|_ ^ b_|_) =< a_|_
1210, 11lel2or 162 . . . . . . 7 ((a_|_ ^ b) v (a_|_ ^ b_|_)) =< a_|_
1312leror 144 . . . . . 6 (((a_|_ ^ b) v (a_|_ ^ b_|_)) v ((a ^ b) v (a ^ b_|_))) =< (a_|_ v ((a ^ b) v (a ^ b_|_)))
149, 13bltr 130 . . . . 5 1 =< (a_|_ v ((a ^ b) v (a ^ b_|_)))
155, 14lebi 137 . . . 4 (a_|_ v ((a ^ b) v (a ^ b_|_))) = 1
164, 15lem3.1 425 . . 3 ((a ^ b) v (a ^ b_|_)) = a
1716ax-r1 34 . 2 a = ((a ^ b) v (a ^ b_|_))
1817df-c1 124 1 a C b
Colors of variables: term
Syntax hints:   = wb 1   C wc 3  _|_wn 4   v wo 6   ^ wa 7  1wt 9   C wcmtr 28
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-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123  df-c1 124  df-cmtr 126
metamath.org