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

Theorem bina4 277
Description: Pavicic binary logic ax-a4 analog.
Assertion
Ref Expression
bina4 (b ->3 (a v b)) = 1

Proof of Theorem bina4
StepHypRef Expression
1 leo 150 . . 3 b =< (b v a)
2 ax-a2 30 . . 3 (b v a) = (a v b)
31, 2lbtr 131 . 2 b =< (a v b)
43lei3 238 1 (b ->3 (a v b)) = 1
Colors of variables: term
Syntax hints:   = wb 1   v wo 6  1wt 9   ->3 wi3 15
This theorem is referenced by:  i3ror 514  i3th2 526
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
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-i3 45  df-le1 122  df-le2 123
metamath.org