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

Theorem wcom2an 410
Description: Th. 4.2 Beran p. 49.
Hypotheses
Ref Expression
wfh.1 C (a, b) = 1
wfh.2 C (a, c) = 1
Assertion
Ref Expression
wcom2an C (a, (b ^ c)) = 1

Proof of Theorem wcom2an
StepHypRef Expression
1 wfh.1 . . . . 5 C (a, b) = 1
21wcomcom4 399 . . . 4 C (a_|_, b_|_) = 1
3 wfh.2 . . . . 5 C (a, c) = 1
43wcomcom4 399 . . . 4 C (a_|_, c_|_) = 1
52, 4wcom2or 409 . . 3 C (a_|_, (b_|_ v c_|_)) = 1
6 df-a 39 . . . . . 6 (b ^ c) = (b_|_ v c_|_)_|_
76con2 64 . . . . 5 (b ^ c)_|_ = (b_|_ v c_|_)
87ax-r1 34 . . . 4 (b_|_ v c_|_) = (b ^ c)_|_
98bi1 110 . . 3 ((b_|_ v c_|_) == (b ^ c)_|_) = 1
105, 9wcbtr 393 . 2 C (a_|_, (b ^ c)_|_) = 1
1110wcomcom5 402 1 C (a, (b ^ c)) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   C wcmtr 28
This theorem is referenced by:  ska4 415
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-wom 343
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le 121  df-le1 122  df-le2 123  df-cmtr 126
metamath.org