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

Theorem 1oai1 803
Description: Orthoarguesian-like OM law.
Assertion
Ref Expression
1oai1 ((a ->1 c) ^ ((a ^ b)_|_ ->1 ((a ->1 c) ^ (b ->1 c)))) =< (b ->1 c)

Proof of Theorem 1oai1
StepHypRef Expression
1 1oa 802 . 2 ((c_|_ ->2 a_|_) ^ ((a_|_ v b_|_) ->1 ((c_|_ ->2 a_|_) ^ (c_|_ ->2 b_|_)))) =< (c_|_ ->2 b_|_)
2 i1i2 258 . . 3 (a ->1 c) = (c_|_ ->2 a_|_)
3 oran3 85 . . . . 5 (a_|_ v b_|_) = (a ^ b)_|_
43ax-r1 34 . . . 4 (a ^ b)_|_ = (a_|_ v b_|_)
5 i1i2 258 . . . . 5 (b ->1 c) = (c_|_ ->2 b_|_)
62, 52an 72 . . . 4 ((a ->1 c) ^ (b ->1 c)) = ((c_|_ ->2 a_|_) ^ (c_|_ ->2 b_|_))
74, 6ud1lem0ab 249 . . 3 ((a ^ b)_|_ ->1 ((a ->1 c) ^ (b ->1 c))) = ((a_|_ v b_|_) ->1 ((c_|_ ->2 a_|_) ^ (c_|_ ->2 b_|_)))
82, 72an 72 . 2 ((a ->1 c) ^ ((a ^ b)_|_ ->1 ((a ->1 c) ^ (b ->1 c)))) = ((c_|_ ->2 a_|_) ^ ((a_|_ v b_|_) ->1 ((c_|_ ->2 a_|_) ^ (c_|_ ->2 b_|_))))
91, 8, 5le3tr1 132 1 ((a ->1 c) ^ ((a ^ b)_|_ ->1 ((a ->1 c) ^ (b ->1 c)))) =< (b ->1 c)
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13   ->2 wi2 14
This theorem is referenced by:  2oai1u 804  d3oa 975
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-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org