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

Theorem oat 907
Description: Transformation lemma for studying the orthoarguesian law.
Hypothesis
Ref Expression
oat.1 (a_|_ ^ (a v b)) =< c
Assertion
Ref Expression
oat b =< (a_|_ ->1 c)

Proof of Theorem oat
StepHypRef Expression
1 leor 151 . . 3 b =< (a v b)
2 oml 427 . . . . 5 (a v (a_|_ ^ (a v b))) = (a v b)
32ax-r1 34 . . . 4 (a v b) = (a v (a_|_ ^ (a v b)))
4 lea 152 . . . . . 6 (a_|_ ^ (a v b)) =< a_|_
5 oat.1 . . . . . 6 (a_|_ ^ (a v b)) =< c
64, 5ler2an 165 . . . . 5 (a_|_ ^ (a v b)) =< (a_|_ ^ c)
76lelor 158 . . . 4 (a v (a_|_ ^ (a v b))) =< (a v (a_|_ ^ c))
83, 7bltr 130 . . 3 (a v b) =< (a v (a_|_ ^ c))
91, 8letr 129 . 2 b =< (a v (a_|_ ^ c))
10 ax-a1 29 . . . 4 a = a_|__|_
1110ax-r5 37 . . 3 (a v (a_|_ ^ c)) = (a_|__|_ v (a_|_ ^ c))
12 df-i1 43 . . . 4 (a_|_ ->1 c) = (a_|__|_ v (a_|_ ^ c))
1312ax-r1 34 . . 3 (a_|__|_ v (a_|_ ^ c)) = (a_|_ ->1 c)
1411, 13ax-r2 35 . 2 (a v (a_|_ ^ c)) = (a_|_ ->1 c)
159, 14lbtr 131 1 b =< (a_|_ ->1 c)
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->1 wi1 13
This theorem is referenced by:  oa4ctod 948
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  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-le1 122  df-le2 123
metamath.org