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

Theorem i3orlem4 537
Description: Lemma for Kalmbach implication OR builder.
Assertion
Ref Expression
i3orlem4 ((a v c)_|_ ^ (b v c)) =< ((a v c) ->3 (b v c))

Proof of Theorem i3orlem4
StepHypRef Expression
1 leo 150 . . 3 ((a v c)_|_ ^ (b v c)) =< (((a v c)_|_ ^ (b v c)) v ((a v c)_|_ ^ (b v c)_|_))
21ler 141 . 2 ((a v c)_|_ ^ (b v c)) =< ((((a v c)_|_ ^ (b v c)) v ((a v c)_|_ ^ (b v c)_|_)) v ((a v c) ^ ((a v c)_|_ v (b v c))))
3 df-i3 45 . . 3 ((a v c) ->3 (b v c)) = ((((a v c)_|_ ^ (b v c)) v ((a v c)_|_ ^ (b v c)_|_)) v ((a v c) ^ ((a v c)_|_ v (b v c))))
43ax-r1 34 . 2 ((((a v c)_|_ ^ (b v c)) v ((a v c)_|_ ^ (b v c)_|_)) v ((a v c) ^ ((a v c)_|_ v (b v c)))) = ((a v c) ->3 (b v c))
52, 4lbtr 131 1 ((a v c)_|_ ^ (b v c)) =< ((a v c) ->3 (b v c))
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   v wo 6   ^ wa 7   ->3 wi3 15
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
This theorem depends on definitions:  df-a 39  df-i3 45  df-le1 122  df-le2 123
metamath.org