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

Theorem i3or 479
Description: Kalmbach implication OR builder.
Assertion
Ref Expression
i3or ((a == b)_|_ v ((a v c) ->3 (b v c))) = 1

Proof of Theorem i3or
StepHypRef Expression
1 le1 138 . 2 ((a == b)_|_ v ((a v c) ->3 (b v c))) =< 1
2 ka4ot 417 . . . 4 ((a == b)_|_ v ((a v c) == (b v c))) = 1
32ax-r1 34 . . 3 1 = ((a == b)_|_ v ((a v c) == (b v c)))
4 i3bi 478 . . . . . 6 (((a v c) ->3 (b v c)) ^ ((b v c) ->3 (a v c))) = ((a v c) == (b v c))
54ax-r1 34 . . . . 5 ((a v c) == (b v c)) = (((a v c) ->3 (b v c)) ^ ((b v c) ->3 (a v c)))
6 lea 152 . . . . 5 (((a v c) ->3 (b v c)) ^ ((b v c) ->3 (a v c))) =< ((a v c) ->3 (b v c))
75, 6bltr 130 . . . 4 ((a v c) == (b v c)) =< ((a v c) ->3 (b v c))
87lelor 158 . . 3 ((a == b)_|_ v ((a v c) == (b v c))) =< ((a == b)_|_ v ((a v c) ->3 (b v c)))
93, 8bltr 130 . 2 1 =< ((a == b)_|_ v ((a v c) ->3 (b v c)))
101, 9lebi 137 1 ((a == b)_|_ v ((a v c) ->3 (b v c))) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7  1wt 9   ->3 wi3 15
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  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-i3 45  df-le 121  df-le1 122  df-le2 123  df-c1 124  df-c2 125  df-cmtr 126
metamath.org