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

Theorem wcom2or 409
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
wcom2or C (a, (b v c)) = 1

Proof of Theorem wcom2or
StepHypRef Expression
1 wfh.1 . . . . . . . . 9 C (a, b) = 1
21wcomcom 396 . . . . . . . 8 C (b, a) = 1
32wdf-c2 366 . . . . . . 7 (b == ((b ^ a) v (b ^ a_|_))) = 1
4 ancom 68 . . . . . . . . 9 (b ^ a) = (a ^ b)
5 ancom 68 . . . . . . . . 9 (b ^ a_|_) = (a_|_ ^ b)
64, 52or 67 . . . . . . . 8 ((b ^ a) v (b ^ a_|_)) = ((a ^ b) v (a_|_ ^ b))
76bi1 110 . . . . . . 7 (((b ^ a) v (b ^ a_|_)) == ((a ^ b) v (a_|_ ^ b))) = 1
83, 7wr2 353 . . . . . 6 (b == ((a ^ b) v (a_|_ ^ b))) = 1
9 wfh.2 . . . . . . . . 9 C (a, c) = 1
109wcomcom 396 . . . . . . . 8 C (c, a) = 1
1110wdf-c2 366 . . . . . . 7 (c == ((c ^ a) v (c ^ a_|_))) = 1
12 ancom 68 . . . . . . . . 9 (c ^ a) = (a ^ c)
13 ancom 68 . . . . . . . . 9 (c ^ a_|_) = (a_|_ ^ c)
1412, 132or 67 . . . . . . . 8 ((c ^ a) v (c ^ a_|_)) = ((a ^ c) v (a_|_ ^ c))
1514bi1 110 . . . . . . 7 (((c ^ a) v (c ^ a_|_)) == ((a ^ c) v (a_|_ ^ c))) = 1
1611, 15wr2 353 . . . . . 6 (c == ((a ^ c) v (a_|_ ^ c))) = 1
178, 16w2or 354 . . . . 5 ((b v c) == (((a ^ b) v (a_|_ ^ b)) v ((a ^ c) v (a_|_ ^ c)))) = 1
18 or4 77 . . . . . 6 (((a ^ b) v (a_|_ ^ b)) v ((a ^ c) v (a_|_ ^ c))) = (((a ^ b) v (a ^ c)) v ((a_|_ ^ b) v (a_|_ ^ c)))
1918bi1 110 . . . . 5 ((((a ^ b) v (a_|_ ^ b)) v ((a ^ c) v (a_|_ ^ c))) == (((a ^ b) v (a ^ c)) v ((a_|_ ^ b) v (a_|_ ^ c)))) = 1
2017, 19wr2 353 . . . 4 ((b v c) == (((a ^ b) v (a ^ c)) v ((a_|_ ^ b) v (a_|_ ^ c)))) = 1
21 ancom 68 . . . . . . . 8 ((b v c) ^ a) = (a ^ (b v c))
2221bi1 110 . . . . . . 7 (((b v c) ^ a) == (a ^ (b v c))) = 1
231, 9wfh1 405 . . . . . . 7 ((a ^ (b v c)) == ((a ^ b) v (a ^ c))) = 1
2422, 23wr2 353 . . . . . 6 (((b v c) ^ a) == ((a ^ b) v (a ^ c))) = 1
25 ancom 68 . . . . . . . 8 ((b v c) ^ a_|_) = (a_|_ ^ (b v c))
2625bi1 110 . . . . . . 7 (((b v c) ^ a_|_) == (a_|_ ^ (b v c))) = 1
271wcomcom3 398 . . . . . . . 8 C (a_|_, b) = 1
289wcomcom3 398 . . . . . . . 8 C (a_|_, c) = 1
2927, 28wfh1 405 . . . . . . 7 ((a_|_ ^ (b v c)) == ((a_|_ ^ b) v (a_|_ ^ c))) = 1
3026, 29wr2 353 . . . . . 6 (((b v c) ^ a_|_) == ((a_|_ ^ b) v (a_|_ ^ c))) = 1
3124, 30w2or 354 . . . . 5 ((((b v c) ^ a) v ((b v c) ^ a_|_)) == (((a ^ b) v (a ^ c)) v ((a_|_ ^ b) v (a_|_ ^ c)))) = 1
3231wr1 189 . . . 4 ((((a ^ b) v (a ^ c)) v ((a_|_ ^ b) v (a_|_ ^ c))) == (((b v c) ^ a) v ((b v c) ^ a_|_))) = 1
3320, 32wr2 353 . . 3 ((b v c) == (((b v c) ^ a) v ((b v c) ^ a_|_))) = 1
3433wdf-c1 365 . 2 C ((b v c), a) = 1
3534wcomcom 396 1 C (a, (b v 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:  wcom2an 410  ska2 414  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