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

Theorem comi1 691
Description: Commutation expressed with ->1.
Hypothesis
Ref Expression
comi1.1 a C b
Assertion
Ref Expression
comi1 b =< (a ->1 b)

Proof of Theorem comi1
StepHypRef Expression
1 ancom 68 . . . . 5 (b ^ a) = (a ^ b)
21ax-r5 37 . . . 4 ((b ^ a) v (b ^ a_|_)) = ((a ^ b) v (b ^ a_|_))
3 ax-a2 30 . . . 4 ((a ^ b) v (b ^ a_|_)) = ((b ^ a_|_) v (a ^ b))
42, 3ax-r2 35 . . 3 ((b ^ a) v (b ^ a_|_)) = ((b ^ a_|_) v (a ^ b))
5 lear 153 . . . 4 (b ^ a_|_) =< a_|_
65leror 144 . . 3 ((b ^ a_|_) v (a ^ b)) =< (a_|_ v (a ^ b))
74, 6bltr 130 . 2 ((b ^ a) v (b ^ a_|_)) =< (a_|_ v (a ^ b))
8 comi1.1 . . . 4 a C b
98comcom 435 . . 3 b C a
109df-c2 125 . 2 b = ((b ^ a) v (b ^ a_|_))
11 df-i1 43 . 2 (a ->1 b) = (a_|_ v (a ^ b))
127, 10, 11le3tr1 132 1 b =< (a ->1 b)
Colors of variables: term
Syntax hints:   =< wle 2   C wc 3  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13
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  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org