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

Theorem 3vcom 795
Description: 3-variable commutation theorem
Assertion
Ref Expression
3vcom ((a ->1 c) v (b ->1 c)) C ((a_|_ ->1 c) ^ (b_|_ ->1 c))

Proof of Theorem 3vcom
StepHypRef Expression
1 oran3 85 . . . . 5 ((a_|_ ->1 c)_|_ v (b_|_ ->1 c)_|_) = ((a_|_ ->1 c) ^ (b_|_ ->1 c))_|_
21ax-r1 34 . . . 4 ((a_|_ ->1 c) ^ (b_|_ ->1 c))_|_ = ((a_|_ ->1 c)_|_ v (b_|_ ->1 c)_|_)
3 u1lem9ab 761 . . . . . 6 (a_|_ ->1 c)_|_ =< (a ->1 c)
4 u1lem9ab 761 . . . . . 6 (b_|_ ->1 c)_|_ =< (b ->1 c)
53, 4le2or 160 . . . . 5 ((a_|_ ->1 c)_|_ v (b_|_ ->1 c)_|_) =< ((a ->1 c) v (b ->1 c))
65lecom 172 . . . 4 ((a_|_ ->1 c)_|_ v (b_|_ ->1 c)_|_) C ((a ->1 c) v (b ->1 c))
72, 6bctr 173 . . 3 ((a_|_ ->1 c) ^ (b_|_ ->1 c))_|_ C ((a ->1 c) v (b ->1 c))
87comcom6 441 . 2 ((a_|_ ->1 c) ^ (b_|_ ->1 c)) C ((a ->1 c) v (b ->1 c))
98comcom 435 1 ((a ->1 c) v (b ->1 c)) C ((a_|_ ->1 c) ^ (b_|_ ->1 c))
Colors of variables: term
Syntax hints:   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