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

Theorem ka4ot 417
Description: 3-variable version of weakly orthomodular law. It is proved from a weaker-looking equivalent, wom2 416, which in turn is proved from ax-wom 343.
Assertion
Ref Expression
ka4ot ((a == b)_|_ v ((a v c) == (b v c))) = 1

Proof of Theorem ka4ot
StepHypRef Expression
1 le1 138 . 2 ((a == b)_|_ v ((a v c) == (b v c))) =< 1
2 wom2 416 . . . . . 6 a =< ((a == b)_|_ v ((a v c) == (b v c)))
3 wom2 416 . . . . . . 7 b =< ((b == a)_|_ v ((b v c) == (a v c)))
4 bicom 88 . . . . . . . . 9 (b == a) = (a == b)
54ax-r4 36 . . . . . . . 8 (b == a)_|_ = (a == b)_|_
6 bicom 88 . . . . . . . 8 ((b v c) == (a v c)) = ((a v c) == (b v c))
75, 62or 67 . . . . . . 7 ((b == a)_|_ v ((b v c) == (a v c))) = ((a == b)_|_ v ((a v c) == (b v c)))
83, 7lbtr 131 . . . . . 6 b =< ((a == b)_|_ v ((a v c) == (b v c)))
92, 8le2or 160 . . . . 5 (a v b) =< (((a == b)_|_ v ((a v c) == (b v c))) v ((a == b)_|_ v ((a v c) == (b v c))))
10 oridm 102 . . . . 5 (((a == b)_|_ v ((a v c) == (b v c))) v ((a == b)_|_ v ((a v c) == (b v c)))) = ((a == b)_|_ v ((a v c) == (b v c)))
119, 10lbtr 131 . . . 4 (a v b) =< ((a == b)_|_ v ((a v c) == (b v c)))
1211leror 144 . . 3 ((a v b) v ((a v c) == (b v c))) =< (((a == b)_|_ v ((a v c) == (b v c))) v ((a v c) == (b v c)))
13 ka4lemo 220 . . 3 ((a v b) v ((a v c) == (b v c))) = 1
14 ax-a3 31 . . . 4 (((a == b)_|_ v ((a v c) == (b v c))) v ((a v c) == (b v c))) = ((a == b)_|_ v (((a v c) == (b v c)) v ((a v c) == (b v c))))
15 oridm 102 . . . . 5 (((a v c) == (b v c)) v ((a v c) == (b v c))) = ((a v c) == (b v c))
1615lor 66 . . . 4 ((a == b)_|_ v (((a v c) == (b v c)) v ((a v c) == (b v c)))) = ((a == b)_|_ v ((a v c) == (b v c)))
1714, 16ax-r2 35 . . 3 (((a == b)_|_ v ((a v c) == (b v c))) v ((a v c) == (b v c))) = ((a == b)_|_ v ((a v c) == (b v c)))
1812, 13, 17le3tr2 133 . 2 1 =< ((a == b)_|_ v ((a v c) == (b v c)))
191, 18lebi 137 1 ((a == b)_|_ v ((a v c) == (b v c))) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6  1wt 9
This theorem is referenced by:  i3or 479
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