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

Theorem wfh1 405
Description: Weak structural analog of Foulis-Holland Theorem.
Hypotheses
Ref Expression
wfh.1 C (a, b) = 1
wfh.2 C (a, c) = 1
Assertion
Ref Expression
wfh1 ((a ^ (b v c)) == ((a ^ b) v (a ^ c))) = 1

Proof of Theorem wfh1
StepHypRef Expression
1 wledi 387 . . 3 (((a ^ b) v (a ^ c)) =<2 (a ^ (b v c))) = 1
2 ancom 68 . . . . . . 7 (a ^ (b v c)) = ((b v c) ^ a)
32bi1 110 . . . . . 6 ((a ^ (b v c)) == ((b v c) ^ a)) = 1
4 df-a 39 . . . . . . . . . 10 (a ^ b) = (a_|_ v b_|_)_|_
54bi1 110 . . . . . . . . 9 ((a ^ b) == (a_|_ v b_|_)_|_) = 1
6 df-a 39 . . . . . . . . . 10 (a ^ c) = (a_|_ v c_|_)_|_
76bi1 110 . . . . . . . . 9 ((a ^ c) == (a_|_ v c_|_)_|_) = 1
85, 7w2or 354 . . . . . . . 8 (((a ^ b) v (a ^ c)) == ((a_|_ v b_|_)_|_ v (a_|_ v c_|_)_|_)) = 1
9 df-a 39 . . . . . . . . . . 11 ((a_|_ v b_|_) ^ (a_|_ v c_|_)) = ((a_|_ v b_|_)_|_ v (a_|_ v c_|_)_|_)_|_
109bi1 110 . . . . . . . . . 10 (((a_|_ v b_|_) ^ (a_|_ v c_|_)) == ((a_|_ v b_|_)_|_ v (a_|_ v c_|_)_|_)_|_) = 1
1110wr1 189 . . . . . . . . 9 (((a_|_ v b_|_)_|_ v (a_|_ v c_|_)_|_)_|_ == ((a_|_ v b_|_) ^ (a_|_ v c_|_))) = 1
1211wcon3 201 . . . . . . . 8 (((a_|_ v b_|_)_|_ v (a_|_ v c_|_)_|_) == ((a_|_ v b_|_) ^ (a_|_ v c_|_))_|_) = 1
138, 12wr2 353 . . . . . . 7 (((a ^ b) v (a ^ c)) == ((a_|_ v b_|_) ^ (a_|_ v c_|_))_|_) = 1
1413wcon2 200 . . . . . 6 (((a ^ b) v (a ^ c))_|_ == ((a_|_ v b_|_) ^ (a_|_ v c_|_))) = 1
153, 14w2an 355 . . . . 5 (((a ^ (b v c)) ^ ((a ^ b) v (a ^ c))_|_) == (((b v c) ^ a) ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_)))) = 1
16 anass 69 . . . . . . . 8 (((b v c) ^ a) ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) = ((b v c) ^ (a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))))
1716bi1 110 . . . . . . 7 ((((b v c) ^ a) ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) == ((b v c) ^ (a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))))) = 1
18 wfh.1 . . . . . . . . . . . 12 C (a, b) = 1
1918wcomcom2 397 . . . . . . . . . . 11 C (a, b_|_) = 1
2019wcom3ii 401 . . . . . . . . . 10 ((a ^ (a_|_ v b_|_)) == (a ^ b_|_)) = 1
21 wfh.2 . . . . . . . . . . . 12 C (a, c) = 1
2221wcomcom2 397 . . . . . . . . . . 11 C (a, c_|_) = 1
2322wcom3ii 401 . . . . . . . . . 10 ((a ^ (a_|_ v c_|_)) == (a ^ c_|_)) = 1
2420, 23w2an 355 . . . . . . . . 9 (((a ^ (a_|_ v b_|_)) ^ (a ^ (a_|_ v c_|_))) == ((a ^ b_|_) ^ (a ^ c_|_))) = 1
25 anandi 106 . . . . . . . . . 10 (a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) = ((a ^ (a_|_ v b_|_)) ^ (a ^ (a_|_ v c_|_)))
2625bi1 110 . . . . . . . . 9 ((a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) == ((a ^ (a_|_ v b_|_)) ^ (a ^ (a_|_ v c_|_)))) = 1
27 anandi 106 . . . . . . . . . 10 (a ^ (b_|_ ^ c_|_)) = ((a ^ b_|_) ^ (a ^ c_|_))
2827bi1 110 . . . . . . . . 9 ((a ^ (b_|_ ^ c_|_)) == ((a ^ b_|_) ^ (a ^ c_|_))) = 1
2924, 26, 28w3tr1 356 . . . . . . . 8 ((a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) == (a ^ (b_|_ ^ c_|_))) = 1
3029wlan 352 . . . . . . 7 (((b v c) ^ (a ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_)))) == ((b v c) ^ (a ^ (b_|_ ^ c_|_)))) = 1
3117, 30wr2 353 . . . . . 6 ((((b v c) ^ a) ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) == ((b v c) ^ (a ^ (b_|_ ^ c_|_)))) = 1
32 an12 74 . . . . . . 7 ((b v c) ^ (a ^ (b_|_ ^ c_|_))) = (a ^ ((b v c) ^ (b_|_ ^ c_|_)))
3332bi1 110 . . . . . 6 (((b v c) ^ (a ^ (b_|_ ^ c_|_))) == (a ^ ((b v c) ^ (b_|_ ^ c_|_)))) = 1
3431, 33wr2 353 . . . . 5 ((((b v c) ^ a) ^ ((a_|_ v b_|_) ^ (a_|_ v c_|_))) == (a ^ ((b v c) ^ (b_|_ ^ c_|_)))) = 1
3515, 34wr2 353 . . . 4 (((a ^ (b v c)) ^ ((a ^ b) v (a ^ c))_|_) == (a ^ ((b v c) ^ (b_|_ ^ c_|_)))) = 1
36 oran 79 . . . . . . . . . . 11 (b v c) = (b_|_ ^ c_|_)_|_
3736bi1 110 . . . . . . . . . 10 ((b v c) == (b_|_ ^ c_|_)_|_) = 1
3837wr1 189 . . . . . . . . 9 ((b_|_ ^ c_|_)_|_ == (b v c)) = 1
3938wcon3 201 . . . . . . . 8 ((b_|_ ^ c_|_) == (b v c)_|_) = 1
4039wlan 352 . . . . . . 7 (((b v c) ^ (b_|_ ^ c_|_)) == ((b v c) ^ (b v c)_|_)) = 1
41 dff 93 . . . . . . . . 9 0 = ((b v c) ^ (b v c)_|_)
4241bi1 110 . . . . . . . 8 (0 == ((b v c) ^ (b v c)_|_)) = 1
4342wr1 189 . . . . . . 7 (((b v c) ^ (b v c)_|_) == 0) = 1
4440, 43wr2 353 . . . . . 6 (((b v c) ^ (b_|_ ^ c_|_)) == 0) = 1
4544wlan 352 . . . . 5 ((a ^ ((b v c) ^ (b_|_ ^ c_|_))) == (a ^ 0)) = 1
46 an0 100 . . . . . 6 (a ^ 0) = 0
4746bi1 110 . . . . 5 ((a ^ 0) == 0) = 1
4845, 47wr2 353 . . . 4 ((a ^ ((b v c) ^ (b_|_ ^ c_|_))) == 0) = 1
4935, 48wr2 353 . . 3 (((a ^ (b v c)) ^ ((a ^ b) v (a ^ c))_|_) == 0) = 1
501, 49wom5 363 . 2 (((a ^ b) v (a ^ c)) == (a ^ (b v c))) = 1
5150wr1 189 1 ((a ^ (b v c)) == ((a ^ b) v (a ^ c))) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9  0wf 10   C wcmtr 28
This theorem is referenced by:  wfh3 407  wcom2or 409  wnbdi 411  wlem14 412  ska2 414
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