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

Theorem comcom5 440
Description: Commutation equivalence. Kalmbach 83 p. 23.
Hypothesis
Ref Expression
comcom5.1 a_|_ C b_|_
Assertion
Ref Expression
comcom5 a C b

Proof of Theorem comcom5
StepHypRef Expression
1 comcom5.1 . . . . 5 a_|_ C b_|_
21comcom4 437 . . . 4 a_|__|_ C b_|__|_
32df-c2 125 . . 3 a_|__|_ = ((a_|__|_ ^ b_|__|_) v (a_|__|_ ^ b_|__|__|_))
4 ax-a1 29 . . 3 a = a_|__|_
5 ax-a1 29 . . . . 5 b = b_|__|_
64, 52an 72 . . . 4 (a ^ b) = (a_|__|_ ^ b_|__|_)
7 ax-a1 29 . . . . 5 b_|_ = b_|__|__|_
84, 72an 72 . . . 4 (a ^ b_|_) = (a_|__|_ ^ b_|__|__|_)
96, 82or 67 . . 3 ((a ^ b) v (a ^ b_|_)) = ((a_|__|_ ^ b_|__|_) v (a_|__|_ ^ b_|__|__|_))
103, 4, 93tr1 60 . 2 a = ((a ^ b) v (a ^ b_|_))
1110df-c1 124 1 a C b
Colors of variables: term
Syntax hints:   C wc 3  _|_wn 4   v wo 6   ^ wa 7
This theorem is referenced by:  comcom6 441  comcom7 442  comdr 448  df2c1 450  com2an 466  oml4 469  gstho 473  df2i3 480  i3lem2 487  comi31 490  ud1lem1 542  ud1lem3 544  ud4lem1a 559  ud4lem1b 560  ud4lem1c 561  ud4lem1d 562  ud4lem1 563  ud5lem1a 568
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-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org