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

Theorem gomaex3lem2 895
Description: Lemma for Godowski 6-var -> Mayet Example 3.
Hypothesis
Ref Expression
gomaex3lem2.5 e =< f_|_
Assertion
Ref Expression
gomaex3lem2 ((e v f)_|_ v f) = e_|_

Proof of Theorem gomaex3lem2
StepHypRef Expression
1 gomaex3lem2.5 . . . . . 6 e =< f_|_
21lecon3 149 . . . . 5 f =< e_|_
32lecom 172 . . . 4 f C e_|_
4 comid 179 . . . . 5 f C f
54comcom2 175 . . . 4 f C f_|_
63, 5fh3r 457 . . 3 ((e_|_ ^ f_|_) v f) = ((e_|_ v f) ^ (f_|_ v f))
7 anor3 82 . . . . 5 (e_|_ ^ f_|_) = (e v f)_|_
87ax-r5 37 . . . 4 ((e_|_ ^ f_|_) v f) = ((e v f)_|_ v f)
98ax-r1 34 . . 3 ((e v f)_|_ v f) = ((e_|_ ^ f_|_) v f)
10 a5c 113 . . . . . 6 (e_|_ ^ (e_|_ v f)) = e_|_
1110df2le1 127 . . . . 5 e_|_ =< (e_|_ v f)
12 leid 140 . . . . . 6 e_|_ =< e_|_
1312, 2lel2or 162 . . . . 5 (e_|_ v f) =< e_|_
1411, 13lebi 137 . . . 4 e_|_ = (e_|_ v f)
15 df-t 40 . . . . 5 1 = (f v f_|_)
16 ax-a2 30 . . . . 5 (f v f_|_) = (f_|_ v f)
1715, 16ax-r2 35 . . . 4 1 = (f_|_ v f)
1814, 172an 72 . . 3 (e_|_ ^ 1) = ((e_|_ v f) ^ (f_|_ v f))
196, 9, 183tr1 60 . 2 ((e v f)_|_ v f) = (e_|_ ^ 1)
20 an1 98 . 2 (e_|_ ^ 1) = e_|_
2119, 20ax-r2 35 1 ((e v f)_|_ v f) = e_|_
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2  _|_wn 4   v wo 6   ^ wa 7  1wt 9
This theorem is referenced by:  gomaex3lem7 900
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-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org