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

Theorem oa64v 1010
Description: Derivation of 4-variable OA from 6-variable OA.
Hypotheses
Ref Expression
oa64v.1 a =< b_|_
oa64v.2 c =< d_|_
Assertion
Ref Expression
oa64v ((a v b) ^ (c v d)) =< (b v (a ^ (c v ((a v c) ^ (b v d)))))

Proof of Theorem oa64v
StepHypRef Expression
1 oa64v.1 . . 3 a =< b_|_
2 oa64v.2 . . 3 c =< d_|_
3 le0 139 . . 3 0 =< 1_|_
41, 2, 3ax-oa6 1009 . 2 (((a v b) ^ (c v d)) ^ (0 v 1)) =< (b v (a ^ (c v (((a v c) ^ (b v d)) ^ (((a v 0) ^ (b v 1)) v ((c v 0) ^ (d v 1)))))))
5 id 58 . 2 0 = 0
6 id 58 . 2 1 = 1
74, 5, 6oa6v4v 913 1 ((a v b) ^ (c v d)) =< (b v (a ^ (c v ((a v c) ^ (b v d)))))
Colors of variables: term
Syntax hints:   =< wle 2  _|_wn 4   v wo 6   ^ wa 7  1wt 9  0wf 10
This theorem is referenced by:  oa63v 1011
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-oa6 1009
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-le1 122  df-le2 123
metamath.org