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

Theorem go1 335
Description: Lemma for proof of Mayet 8-variable "full" equation from 4-variable Godowski equation.
Assertion
Ref Expression
go1 ((a ^ b) ^ (a ->1 b_|_)) = 0

Proof of Theorem go1
StepHypRef Expression
1 df-i1 43 . . 3 (a ->1 b_|_) = (a_|_ v (a ^ b_|_))
21lan 70 . 2 ((a ^ b) ^ (a ->1 b_|_)) = ((a ^ b) ^ (a_|_ v (a ^ b_|_)))
3 lear 153 . . . . . 6 (a ^ b_|_) =< b_|_
43lelor 158 . . . . 5 (a_|_ v (a ^ b_|_)) =< (a_|_ v b_|_)
54lelan 159 . . . 4 ((a ^ b) ^ (a_|_ v (a ^ b_|_))) =< ((a ^ b) ^ (a_|_ v b_|_))
6 oran3 85 . . . . . 6 (a_|_ v b_|_) = (a ^ b)_|_
76lan 70 . . . . 5 ((a ^ b) ^ (a_|_ v b_|_)) = ((a ^ b) ^ (a ^ b)_|_)
8 dff 93 . . . . . 6 0 = ((a ^ b) ^ (a ^ b)_|_)
98ax-r1 34 . . . . 5 ((a ^ b) ^ (a ^ b)_|_) = 0
107, 9ax-r2 35 . . . 4 ((a ^ b) ^ (a_|_ v b_|_)) = 0
115, 10lbtr 131 . . 3 ((a ^ b) ^ (a_|_ v (a ^ b_|_))) =< 0
12 le0 139 . . 3 0 =< ((a ^ b) ^ (a_|_ v (a ^ b_|_)))
1311, 12lebi 137 . 2 ((a ^ b) ^ (a_|_ v (a ^ b_|_))) = 0
142, 13ax-r2 35 1 ((a ^ b) ^ (a ->1 b_|_)) = 0
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  0wf 10   ->1 wi1 13
This theorem is referenced by:  gomaex4 880
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-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123
metamath.org