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

Theorem wa4 186
Description: Weak A4.
Assertion
Ref Expression
wa4 ((a v (b v b_|_)) == (b v b_|_)) = 1

Proof of Theorem wa4
StepHypRef Expression
1 ax-a4 32 . 2 (a v (b v b_|_)) = (b v b_|_)
21bi1 110 1 ((a v (b v b_|_)) == (b v b_|_)) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6  1wt 9
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41
metamath.org