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

Theorem 2vwomlem 347
Description: Lemma from 2-variable WOML rule.
Hypotheses
Ref Expression
2vwomlem.1 (a ->2 b) = 1
2vwomlem.2 (b ->2 a) = 1
Assertion
Ref Expression
2vwomlem (a == b) = 1

Proof of Theorem 2vwomlem
StepHypRef Expression
1 dfb 86 . 2 (a == b) = ((a ^ b) v (a_|_ ^ b_|_))
2 df-f 41 . . . . 5 0 = 1_|_
3 anor2 81 . . . . . . 7 (a_|_ ^ (a v b)) = (a v (a v b)_|_)_|_
43ax-r1 34 . . . . . 6 (a v (a v b)_|_)_|_ = (a_|_ ^ (a v b))
5 anor3 82 . . . . . . . . . . 11 (a_|_ ^ b_|_) = (a v b)_|_
65ax-r1 34 . . . . . . . . . 10 (a v b)_|_ = (a_|_ ^ b_|_)
7 ancom 68 . . . . . . . . . 10 (a_|_ ^ b_|_) = (b_|_ ^ a_|_)
86, 7ax-r2 35 . . . . . . . . 9 (a v b)_|_ = (b_|_ ^ a_|_)
98lor 66 . . . . . . . 8 (a v (a v b)_|_) = (a v (b_|_ ^ a_|_))
10 df-i2 44 . . . . . . . . 9 (b ->2 a) = (a v (b_|_ ^ a_|_))
1110ax-r1 34 . . . . . . . 8 (a v (b_|_ ^ a_|_)) = (b ->2 a)
12 2vwomlem.2 . . . . . . . 8 (b ->2 a) = 1
139, 11, 123tr 62 . . . . . . 7 (a v (a v b)_|_) = 1
1413ax-r4 36 . . . . . 6 (a v (a v b)_|_)_|_ = 1_|_
15 a5c 113 . . . . . . . . 9 (a_|_ ^ (a_|_ v b_|_)) = a_|_
1615ax-r1 34 . . . . . . . 8 a_|_ = (a_|_ ^ (a_|_ v b_|_))
1716ran 71 . . . . . . 7 (a_|_ ^ (a v b)) = ((a_|_ ^ (a_|_ v b_|_)) ^ (a v b))
18 anass 69 . . . . . . 7 ((a_|_ ^ (a_|_ v b_|_)) ^ (a v b)) = (a_|_ ^ ((a_|_ v b_|_) ^ (a v b)))
19 oran3 85 . . . . . . . . . 10 (a_|_ v b_|_) = (a ^ b)_|_
20 oran 79 . . . . . . . . . 10 (a v b) = (a_|_ ^ b_|_)_|_
2119, 202an 72 . . . . . . . . 9 ((a_|_ v b_|_) ^ (a v b)) = ((a ^ b)_|_ ^ (a_|_ ^ b_|_)_|_)
22 anor3 82 . . . . . . . . 9 ((a ^ b)_|_ ^ (a_|_ ^ b_|_)_|_) = ((a ^ b) v (a_|_ ^ b_|_))_|_
2321, 22ax-r2 35 . . . . . . . 8 ((a_|_ v b_|_) ^ (a v b)) = ((a ^ b) v (a_|_ ^ b_|_))_|_
2423lan 70 . . . . . . 7 (a_|_ ^ ((a_|_ v b_|_) ^ (a v b))) = (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_)
2517, 18, 243tr 62 . . . . . 6 (a_|_ ^ (a v b)) = (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_)
264, 14, 253tr2 61 . . . . 5 1_|_ = (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_)
272, 26ax-r2 35 . . . 4 0 = (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_)
2827lor 66 . . 3 (((a ^ b) v (a_|_ ^ b_|_)) v 0) = (((a ^ b) v (a_|_ ^ b_|_)) v (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_))
29 or0 94 . . 3 (((a ^ b) v (a_|_ ^ b_|_)) v 0) = ((a ^ b) v (a_|_ ^ b_|_))
30 le1 138 . . . . 5 (a_|_ v (a ^ ((a ^ b) v (a_|_ ^ b_|_)))) =< 1
31 df-i2 44 . . . . . . . . . 10 (a ->2 b) = (b v (a_|_ ^ b_|_))
3231ax-r1 34 . . . . . . . . 9 (b v (a_|_ ^ b_|_)) = (a ->2 b)
33 2vwomlem.1 . . . . . . . . 9 (a ->2 b) = 1
3432, 33ax-r2 35 . . . . . . . 8 (b v (a_|_ ^ b_|_)) = 1
35342vwomr2 344 . . . . . . 7 (a_|_ v (a ^ b)) = 1
3635ax-r1 34 . . . . . 6 1 = (a_|_ v (a ^ b))
37 lea 152 . . . . . . . 8 (a ^ b) =< a
38 leo 150 . . . . . . . 8 (a ^ b) =< ((a ^ b) v (a_|_ ^ b_|_))
3937, 38ler2an 165 . . . . . . 7 (a ^ b) =< (a ^ ((a ^ b) v (a_|_ ^ b_|_)))
4039lelor 158 . . . . . 6 (a_|_ v (a ^ b)) =< (a_|_ v (a ^ ((a ^ b) v (a_|_ ^ b_|_))))
4136, 40bltr 130 . . . . 5 1 =< (a_|_ v (a ^ ((a ^ b) v (a_|_ ^ b_|_))))
4230, 41lebi 137 . . . 4 (a_|_ v (a ^ ((a ^ b) v (a_|_ ^ b_|_)))) = 1
4342ax-wom 343 . . 3 (((a ^ b) v (a_|_ ^ b_|_)) v (a_|_ ^ ((a ^ b) v (a_|_ ^ b_|_))_|_)) = 1
4428, 29, 433tr2 61 . 2 ((a ^ b) v (a_|_ ^ b_|_)) = 1
451, 44ax-r2 35 1 (a == b) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9  0wf 10   ->2 wi2 14
This theorem is referenced by:  wr5-2v 348
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-i2 44  df-le1 122  df-le2 123
metamath.org